Refining the partition for multifold conic optimization problems
From MaRDI portal
Publication:5151515
DOI10.1080/02331934.2020.1822835OpenAlexW3094331209MaRDI QIDQ5151515
Vera Roshchina, Héctor Ramírez C.
Publication date: 19 February 2021
Published in: Optimization (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1804.00386
Semidefinite programming (90C22) Convex programming (90C25) Optimality conditions and duality in mathematical programming (90C46)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Facial reduction algorithms for conic optimization problems
- A condition-based algorithm for solving polyhedral feasibility problems
- Unifying optimal partition approach to sensitivity analysis in conic optimization
- A polynomial-time algorithm for a class of linear complementarity problems
- Local convergence of interior-point algorithms for degenerate monotone LCP
- Numerical optimization. Theoretical and practice aspects
- An exact duality theory for semidefinite programming and its complexity implications
- Aspects of semidefinite programming. Interior point algorithms and selected applications
- Condition numbers for polyhedra with real number data
- Strong duality and minimal representations for cone optimization
- A complementarity partition theorem for multifold conic systems
- Perturbation analysis of second-order cone programming problems
- A Strongly Polynomial Rounding Procedure Yielding a Maximally Complementary Solution for $P_*(\kappa)$ Linear Complementarity Problems
- A Mathematical View of Interior-Point Methods in Convex Optimization
- Linear Inequalities and Related Systems. (AM-38)
- A Condition Number for Multifold Conic Systems
- Strong Duality for Semidefinite Programming
- Facial Reduction and Partial Polyhedrality
- On the Identification of the Optimal Partition of Second Order Cone Optimization Problems
- Foundations of Optimization
- Strong Duality in Conic Linear Programming: Facial Reduction and Extended Duals
This page was built for publication: Refining the partition for multifold conic optimization problems
