Genericity Results in Linear Conic Programming—A Tour d’Horizon

DOI10.1287/moor.2016.0793zbMath1359.90093OpenAlexW2355046223MaRDI QIDQ2976141

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

stabilitystrict complementaritygeneric propertiesconic optimizationSlater's conditionuniqueness and nondegeneracy of optimal solutions

Mathematics Subject Classification ID

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

Related Items (13)

Statistical Inference of Second-Order Cone Programming ⋮ Stability of the duality gap in linear optimization ⋮ Recent contributions to linear semi-infinite optimization ⋮ First order solutions in conic programming ⋮ Statistical inference of semidefinite programming with multiple parameters ⋮ Conic optimization: a survey with special focus on copositive optimization and binary quadratic problems ⋮ A strict complementarity approach to error bound and sensitivity of solution of conic programs ⋮ Random projections of linear and semidefinite problems with linear inequalities ⋮ Unnamed Item ⋮ Recent contributions to linear semi-infinite optimization: an update ⋮ A note on primal-dual stability in infinite linear programming ⋮ Statistical inference of semidefinite programming ⋮ Solving Conic Optimization Problems via Self-Dual Embedding and Facial Reduction: A Unified Approach

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the stable solution of large scale problems over the doubly nonnegative cone
• On stable uniqueness in linear semi-infinite optimization
• Geometry of the copositive and completely positive cones
• Primal-dual stability in continuous linear optimization
• A note on the measurability of convex sets
• Complementarity and nondegeneracy in semidefinite programming
• First and second order analysis of nonlinear semidefinite programs
• A generic result in linear semi-infinite optimization
• Nonlinear optimization in finite dimensions. Morse theory, Chebyshev approximation, transversality, flows, parametric aspects
• Copositive programming via semi-infinite optimization
• Intersections and Translative Integral Formulas for Boundaries of Convex Bodies
• Copositive Programming
• Semi-Infinite Programming: Theory, Methods, and Applications
• Stability of the primal-dual partition in linear semi-infinite programming
• Generic Optimality Conditions for Semialgebraic Convex Programs
• Generic primal-dual solvability in continuous linear semi-infinite programming
• A Short Proof of Lebesgue's Density Theorem
• Convex Bodies in Exceptional Relative Positions
• On the generic properties of convex optimization problems in conic form

This page was built for publication: Genericity Results in Linear Conic Programming—A Tour d’Horizon