A primal-dual symmetric relaxation for homogeneous conic systems
From MaRDI portal
Publication:883335
DOI10.1016/j.jco.2007.01.002zbMath1118.65065OpenAlexW2031269429WikidataQ58051165 ScholiaQ58051165MaRDI QIDQ883335
Yao Hui, Juan Carlos Rivera, Juan Carlos Vera, Javier F. Peña
Publication date: 4 June 2007
Published in: Journal of Complexity (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jco.2007.01.002
Numerical mathematical programming methods (65K05) Convex programming (90C25) Interior-point methods (90C51)
Related Items
Average-case complexity without the black swans ⋮ Probabilistic analysis of the Grassmann condition number
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- On the complexity of linear programming under finite precision arithmetic
- A characterization of the distance to infeasibility under block-structured perturbations
- Second-order cone programming
- Complexity of convex optimization using geometry-based measures and a reference point
- Infeasible-start primal-dual methods and infeasibility detectors for nonlinear programming problems
- Computing approximate solutions for convex conic systems of constraints
- Condition number complexity of an elementary algorithm for computing a reliable solution of a conic linear system
- Self-scaled barrier functions on symmetric cones and their classification
- Two properties of condition numbers for convex programs via implicitly defined barrier functions
- Linear programming, complexity theory and elementary functional analysis
- Condition numbers for polyhedra with real number data
- Solving linear programs with finite precision. II: Algorithms
- A Mathematical View of Interior-Point Methods in Convex Optimization
- Associative and Jordan Algebras, and Polynomial Time Interior-Point Algorithms for Symmetric Cones
- A Primal-Dual Algorithm for Solving Polyhedral Conic Systems with a Finite-Precision Machine
- An O(√nL)-Iteration Homogeneous and Self-Dual Linear Programming Algorithm
- Self-Scaled Barriers and Interior-Point Methods for Convex Programming
- Primal-Dual Interior-Point Methods for Self-Scaled Cones
- Condition-Based Complexity of Convex Optimization in Conic Linear Form via the Ellipsoid Algorithm
- Understanding the Geometry of Infeasible Perturbations of a Conic Linear System
