Weak notions of nondegeneracy in nonlinear semidefinite programming

DOI10.1007/s10107-023-01970-4arXiv2012.14810OpenAlexW3118151669MaRDI QIDQ6126643

Roberto Andreani, Leonardo M. Mito, Gabriel Haeser, C. Héctor Ramírez

Publication date: 9 April 2024

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2012.14810

zbMATH Keywords

semidefinite programmingconstraint qualificationsconstraint nondegeneracy

Mathematics Subject Classification ID

Semidefinite programming (90C22) Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30) Optimality conditions and duality in mathematical programming (90C46)

Cites Work

• Unnamed Item
• Sufficient optimality conditions hold for almost all nonlinear semidefinite programs
• Handbook on semidefinite, conic and polynomial optimization
• A relaxed constant positive linear dependence constraint qualification and applications
• Penalty and barrier methods for convex semidefinite programming
• First and second order analysis of nonlinear semidefinite programs
• Optimality conditions for nonconvex semidefinite programming
• Naive constant rank-type constraint qualifications for multifold second-order cone programming and semidefinite programming
• On the best achievable quality of limit points of augmented Lagrangian schemes
• Optimality conditions and global convergence for nonlinear semidefinite programming
• On LICQ and the uniqueness of Lagrange multipliers
• Aubin property and uniqueness of solutions in cone constrained optimization
• Augmented Lagrangian methods under the constant positive linear dependence constraint qualification
• On Metric Regularity for Weakly Almost Piecewise Smooth Functions and Some Applications in Nonlinear Semidefinite Programming
• Second-Order Variational Analysis in Conic Programming with Applications to Optimality and Stability
• On relaxed constant rank regularity condition in mathematical programming
• Solution point differentiability without strict complementarity in nonlinear programming
• Matrix Analysis
• First Order Conditions for General Nonlinear Optimization
• On Uniqueness of Lagrange Multipliers in Optimization Problems Subject to Cone Constraints
• On the Constant Positive Linear Dependence Condition and Its Application to SQP Methods
• On Eigenvalue Optimization
• Two New Weak Constraint Qualifications and Applications
• Full Stability in Finite-Dimensional Optimization
• The Strong Second-Order Sufficient Condition and Constraint Nondegeneracy in Nonlinear Semidefinite Programming and Their Implications
• A SURVEY OF NUMERICAL METHODS FOR NONLINEAR SEMIDEFINITE PROGRAMMING
• Strong Duality in Conic Linear Programming: Facial Reduction and Extended Duals
• On sequential optimality conditions for smooth constrained optimization
• Handbook of semidefinite programming. Theory, algorithms, and applications

This page was built for publication: Weak notions of nondegeneracy in nonlinear semidefinite programming