A primal-dual algorithm for solving polyhedral conic systems with a finite-precision machine

SIAM Journal on Optimization

Volumn 12, Issue 2, 2002, Pages 522-554

  Cucker, Felipe ^a   Peña, Javier ^a  

^a CITY UNIVERSITY OF HONG KONG   (Hong Kong)

Author keywords

Finite precision algorithms; Linear conic systems

Indexed keywords

EID: 0036013028     PISSN: 10526234     EISSN: None     Source Type: Journal    
DOI: 10.1137/S1052623401386794     Document Type: Article

References (25)

1. A stabilization of the simplex method
2. On a theory of computation and complexity over the real numbers: NP-completeness, recursive functions and universal machines
3. A new condition number for linear programming
4. Probabilistic analysis of condition numbers for linear programming
5. Techniques for automatic tolerance control in linear programming
6. Convergence of a class of inexact interior-point algorithms for linear programs
7. Interior path following primal-dual algorithms. Part I: Linear programming
8. The simplex method is not always well behaved
9. Understanding the geometry of infeasible perturbations of a conic linear system
10. Computing approximate solutions for conic systems of constraints
11. Linear programming, complexity theory and elementary functional analysis
12. Condition numbers, the barrier method, and the conjugate-gradient method
13. A characterization of stability in linear programming
14. Error control in the simplex-technique
15. Condition numbers for polyhedra with real number data
16. On the complexity of linear programming under finite precision arithmetic
17. Error in the solution of linear programming problems