Generalized subdifferentials of the sign change counting function
- 125 Downloads
The counting function on binary values is extended to the signed case in order to count the number of transitions between contiguous locations. A generalized subdifferential for this sign change counting function is given where classical subdifferentials remain intractable. An attempt to prove global optimality at some point, for the 4-dimensional first non trivial example, is made by using a sufficient condition specially tailored among all the cases for this subdifferential.
KeywordsSign counting Generalized subdifferential Optimality conditions
- 2.Elkadi, M., Mourrain, B.: Some Applications of Bezoutians in Effective Algebraic Geometry. Technical Report RR-3572, INRIA, Dec 1998Google Scholar