A complementarity partition theorem for multifold conic systems
From MaRDI portal
Publication:2434990
DOI10.1007/s10107-012-0577-0zbMath1282.90130arXiv1108.0760OpenAlexW2090859592MaRDI QIDQ2434990
Vera Roshchina, Javier F. Peña
Publication date: 3 February 2014
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1108.0760
Convex programming (90C25) Optimality conditions and duality in mathematical programming (90C46) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)
Related Items
On the identification of the optimal partition for semidefinite optimization, Bad Semidefinite Programs: They All Look the Same, Refining the partition for multifold conic optimization problems, A rounding procedure for semidefinite optimization
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A primal-dual interior point method whose running time depends only on the constraint matrix
- Complementarity and nondegeneracy in semidefinite programming
- Second-order cone programming
- Infeasible-start primal-dual methods and infeasibility detectors for nonlinear programming problems
- Linear programming, complexity theory and elementary functional analysis
- Strong duality and minimal representations for cone optimization
- On the behavior of the homogeneous self-dual model for conic convex optimization
- A New Condition Measure, Preconditioners, and Relations Between Different Measures of Conditioning for Conic Linear Systems
- Bad Semidefinite Programs: They All Look the Same
- A Condition Number for Multifold Conic Systems
- An O(√nL)-Iteration Homogeneous and Self-Dual Linear Programming Algorithm
- Incorporating Condition Measures into the Complexity Theory of Linear Programming
- On the Closedness of the Linear Image of a Closed Convex Cone
