A primal-dual symmetric relaxation for homogeneous conic systems
DOI10.1016/J.JCO.2007.01.002zbMATH Open1118.65065DBLPjournals/jc/VeraRPH07OpenAlexW2031269429WikidataQ58051165 ScholiaQ58051165MaRDI QIDQ883335FDOQ883335
Authors: Juan Vera, Juan Carlos Rivera, Yao Hui, Javier 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
Recommendations
- Primal-Dual Interior-Point Methods for Self-Scaled Cones
- Computing approximate solutions for convex conic systems of constraints
- A primal-dual algorithm for solving polyhedral conic systems with a finite-precision machine
- Self-Scaled Barriers and Interior-Point Methods for Convex Programming
- Projective re-normalization for improving the behavior of a homogeneous conic linear system
Numerical mathematical programming methods (65K05) Convex programming (90C25) Interior-point methods (90C51)
Cites Work
- Title not available (Why is that?)
- Second-order cone programming
- A mathematical view of interior-point methods in convex optimization
- An O(√nL)-Iteration Homogeneous and Self-Dual Linear Programming Algorithm
- Self-Scaled Barriers and Interior-Point Methods for Convex Programming
- Computing approximate solutions for convex conic systems of constraints
- Title not available (Why is that?)
- Infeasible-start primal-dual methods and infeasibility detectors for nonlinear programming problems
- Associative and Jordan algebras, and polynomial time interior-point algorithms for symmetric cones.
- Primal-Dual Interior-Point Methods for Self-Scaled Cones
- Self-scaled barrier functions on symmetric cones and their classification
- Condition number complexity of an elementary algorithm for computing a reliable solution of a conic linear system
- On the complexity of linear programming under finite precision arithmetic
- Linear programming, complexity theory and elementary functional analysis
- Solving linear programs with finite precision. II: Algorithms
- A primal-dual algorithm for solving polyhedral conic systems with a finite-precision machine
- Condition numbers for polyhedra with real number data
- 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
- Complexity of convex optimization using geometry-based measures and a reference point
- A characterization of the distance to infeasibility under block-structured perturbations
- Two properties of condition numbers for convex programs via implicitly defined barrier functions
Cited In (6)
- HOMOGENEOUS SELF-DUAL METHODS FOR SYMMETRIC CONES UNDER UNCERTAINTY
- Probabilistic analysis of the Grassmann condition number
- Feasibility and solvability of Lyapunov-type linear programming over symmetric cones
- Average-case complexity without the black swans
- Jordan symmetry reduction for conic optimization over the doubly nonnegative cone: theory and software
- A primal-dual algorithm for solving polyhedral conic systems with a finite-precision machine
Uses Software
This page was built for publication: A primal-dual symmetric relaxation for homogeneous conic systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q883335)
