On the generic properties of convex optimization problems in conic form
From MaRDI portal
Publication:5930737
DOI10.1007/s101070000193zbMath0988.90025MaRDI QIDQ5930737
Publication date: 3 October 2001
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Semidefinite programming (90C22) Convex programming (90C25) Linear programming (90C05) Convex functions and convex programs in convex geometry (52A41) Convex sets and cones of operators (47L07)
Related Items
A global linear and local superlinear (quadratic) inexact non-interior continuation method for variational inequalities over general closed convex sets, Convex sets with semidefinite representation, Universal duality in conic convex optimization, Stability of closedness of semi-algebraic sets under continuous semi-algebraic mappings, First order solutions in conic programming, Random projections of linear and semidefinite problems with linear inequalities, On continuous selections of polynomial functions, Generic Properties for Semialgebraic Programs, Genericity Results in Linear Conic Programming—A Tour d’Horizon, Unnamed Item, A note on strict complementarity for the doubly non-negative cone, A note on alternating projections for ill-posed semidefinite feasibility problems, Equivalent conditions for Jacobian nonsingularity in linear symmetric cone programming, Persistent retracts and preparation, Generic Minimizing Behavior in Semialgebraic Optimization, Generic nondegeneracy in convex optimization, Characterizing the universal rigidity of generic frameworks, Strict Complementarity in Semidefinite Optimization with Elliptopes Including the MaxCut SDP, On the R-superlinear convergence of the KKT residuals generated by the augmented Lagrangian method for convex composite conic programming, A Superlinearly Convergent Smoothing Newton Continuation Algorithm for Variational Inequalities over Definable Sets
