Generalized subdifferentials of the sign change counting function
DOI10.1007/s10898-015-0332-1zbMath1353.90116arXiv1312.1814OpenAlexW2100953929MaRDI QIDQ276504
Dominique Fortin, Ider Tseveendorj
Publication date: 4 May 2016
Published in: Journal of Global Optimization, Analysis, Modelling, Optimization, and Numerical Techniques (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1312.1814
optimality conditionsminimizationgeneralized subdifferentialtrigraphsign counting0--1 matricesconsecutive 1s propertyconsecutive sign property
Nonconvex programming, global optimization (90C26) Miscellaneous topics in calculus of variations and optimal control (49N99) Special matrices (15B99) Sign pattern matrices (15B35)
Related Items (1)
Cites Work
- Global optimality conditions for some classes of optimization problems
- Non-convex quadratic minimization problems with quadratic constraints: global optimality conditions
- Optimality conditions in global optimization and their applications
- The Clarke and Michel-Penot subdifferentials of the eigenvalues of a symmetric matrix
- On minima of the difference of functions
- Nonsmooth analysis of eigenvalues
- Convexifying the set of matrices of bounded rank: applications to the quasiconvexification and convexification of the rank function
- Generalized subdifferentials of the rank function
- Sufficient conditions for global optimality of bivalent nonconvex quadratic programs with inequality constraints
- On the representation of approximate subdifferentials for a class of generalized convex functions
- Nonsmooth analysis of singular values. I: Theory
- Nonsmooth analysis of singular values. II: Applications
- Q-subdifferential and Q-conjugate for global optimality
- Abstract convexity and global optimization
- Piecewise-convex maximization problems.
This page was built for publication: Generalized subdifferentials of the sign change counting function
