Genericity results in linear conic programming -- a tour d'horizon

DOI10.1287/MOOR.2016.0793MaRDI QIDQ2976141zbMATH OpenOpenAlexFDO

Authors Mirjam Dür, Bolor Jargalsaikhan, Georg Still

Publication date 13 April 2017

Published in Mathematics of Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1287/moor.2016.0793

zbMATH Keywords

stabilitySlater's conditionstrict complementarityconic optimizationgeneric propertiesuniqueness and nondegeneracy of optimal solutions

Mathematics Subject Classification ID

Convex programming (90C25) Sensitivity, stability, parametric optimization (90C31)

Recommendations

• On the generic properties of convex optimization problems in conic form
• Generic well posedness in linear programming
• Generic properties for semialgebraic programs
• A generic result in linear semi-infinite optimization
• Generic optimality conditions for semialgebraic convex programs

Cites work

• scientific article; zbMATH DE number 3932798 (Why is no real title available?)
• scientific article; zbMATH DE number 1534289 (Why is no real title available?)
• A Short Proof of Lebesgue's Density Theorem
• A generic result in linear semi-infinite optimization
• A note on the measurability of convex sets
• Advances in convex optimization: conic programming
• Complementarity and nondegeneracy in semidefinite programming
• Convex Bodies in Exceptional Relative Positions
• Copositive programming
• Copositive programming via semi-infinite optimization
• First and second order analysis of nonlinear semidefinite programs
• Generic optimality conditions for semialgebraic convex programs
• Generic primal-dual solvability in continuous linear semi-infinite programming
• Geometry of the copositive and completely positive cones
• Intersections and translative integral formulas for boundaries of convex bodies
• Nonlinear optimization in finite dimensions. Morse theory, Chebyshev approximation, transversality, flows, parametric aspects
• On duality theory of conic linear problems.
• On stable uniqueness in linear semi-infinite optimization
• On the generic properties of convex optimization problems in conic form
• On the stable solution of large scale problems over the doubly nonnegative cone
• Primal-dual stability in continuous linear optimization
• Semi-Infinite Programming: Theory, Methods, and Applications
• Stability of closedness of convex cones under linear mappings. II
• Stability of the primal-dual partition in linear semi-infinite programming

Cited in

(15)

• First order solutions in conic programming
• Random projections of linear and semidefinite problems with linear inequalities
• Statistical inference of semidefinite programming
• Generic well posedness in linear programming
• Linear conic and two-stage stochastic optimization revisited via semi-infinite optimization
• Recent contributions to linear semi-infinite optimization: an update
• scientific article; zbMATH DE number 7470579 (Why is no real title available?)
• Solving conic optimization problems via self-dual embedding and facial reduction: A unified approach
• Recent contributions to linear semi-infinite optimization
• A note on primal-dual stability in infinite linear programming
• Statistical inference of semidefinite programming with multiple parameters
• Conic optimization: a survey with special focus on copositive optimization and binary quadratic problems
• Stability of the duality gap in linear optimization
• Statistical inference of second-order cone programming
• A strict complementarity approach to error bound and sensitivity of solution of conic programs

This page was built for publication: Genericity results in linear conic programming -- a tour d'horizon

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2976141)