A strict complementarity approach to error bound and sensitivity of solution of conic programs

DOI10.1007/s11590-022-01942-1arXiv2012.00183OpenAlexW4308202656MaRDI QIDQ6164955

Madeleine Udell, Lijun Ding

Publication date: 28 July 2023

Published in: Optimization Letters (Search for Journal in Brave)

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

zbMATH Keywords

strict complementarityerror boundconic program

Mathematics Subject Classification ID

Nonlinear programming (90C30) Programming in abstract spaces (90C48)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Complementarity and nondegeneracy in semidefinite programming
• Conditioning of semidefinite programs
• A unified approach to error bounds for structured convex optimization problems
• Random Laplacian matrices and convex relaxations
• Strong conical hull intersection property, bounded linear regularity, Jameson's property \((G)\), and error bounds in convex optimization
• Amenable cones: error bounds without constraint qualifications
• Faster subgradient methods for functions with Hölderian growth
• Linear convergence of first order methods for non-strongly convex optimization
• Generic Minimizing Behavior in Semialgebraic Optimization
• Genericity Results in Linear Conic Programming—A Tour d’Horizon
• Linear Inequalities and Related Systems. (AM-38)
• Global Error Bounds for Convex Conic Problems
• Error Bounds for Linear Matrix Inequalities
• On the Simplicity and Conditioning of Low Rank Semidefinite Programs
• An Optimal-Storage Approach to Semidefinite Programming Using Approximate Complementarity
• Error Bounds, Quadratic Growth, and Linear Convergence of Proximal Methods