Genericity Results in Linear Conic Programming—A Tour d’Horizon
From MaRDI portal
Publication:2976141
DOI10.1287/MOOR.2016.0793zbMATH Open1359.90093OpenAlexW2355046223MaRDI QIDQ2976141FDOQ2976141
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
stabilitySlater's conditionstrict complementarityconic optimizationgeneric propertiesuniqueness and nondegeneracy of optimal solutions
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- On duality theory of conic linear problems.
- Semi-Infinite Programming: Theory, Methods, and Applications
- Geometry of the copositive and completely positive cones
- Complementarity and nondegeneracy in semidefinite programming
- Generic Optimality Conditions for Semialgebraic Convex Programs
- A note on the measurability of convex sets
- First and second order analysis of nonlinear semidefinite programs
- Nonlinear optimization in finite dimensions. Morse theory, Chebyshev approximation, transversality, flows, parametric aspects
- Copositive Programming
- On the stable solution of large scale problems over the doubly nonnegative cone
- A Short Proof of Lebesgue's Density Theorem
- A generic result in linear semi-infinite optimization
- Generic primal-dual solvability in continuous linear semi-infinite programming
- On stable uniqueness in linear semi-infinite optimization
- On the generic properties of convex optimization problems in conic form
- Primal-dual stability in continuous linear optimization
- Convex Bodies in Exceptional Relative Positions
- Copositive programming via semi-infinite optimization
- Stability of the primal-dual partition in linear semi-infinite programming
- Intersections and translative integral formulas for boundaries of convex bodies
Cited In (14)
- Conic optimization: a survey with special focus on copositive optimization and binary quadratic problems
- Stability of the duality gap in linear optimization
- Solving Conic Optimization Problems via Self-Dual Embedding and Facial Reduction: A Unified Approach
- A note on primal-dual stability in infinite linear programming
- A strict complementarity approach to error bound and sensitivity of solution of conic programs
- Random projections of linear and semidefinite problems with linear inequalities
- Linear conic and two-stage stochastic optimization revisited via semi-infinite optimization
- First order solutions in conic programming
- Statistical Inference of Second-Order Cone Programming
- Statistical inference of semidefinite programming
- Recent contributions to linear semi-infinite optimization
- Statistical inference of semidefinite programming with multiple parameters
- Title not available (Why is that?)
- Recent contributions to linear semi-infinite optimization: an update
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)
