A Primal-Dual Algorithm for Solving Polyhedral Conic Systems with a Finite-Precision Machine
- 1 January 2002
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Optimization
- Vol. 12 (2) , 522-554
- https://doi.org/10.1137/s1052623401386794
Abstract
No abstract availableKeywords
This publication has 17 references indexed in Scilit:
- Computing approximate solutions for convex conic systems of constraintsMathematical Programming, 2000
- Understanding the Geometry of Infeasible Perturbations of a Conic Linear SystemSIAM Journal on Optimization, 2000
- Condition Numbers, the Barrier Method, and the Conjugate-Gradient MethodSIAM Journal on Optimization, 1996
- Condition numbers for polyhedra with real number dataOperations Research Letters, 1995
- Interior path following primal-dual algorithms. part I: Linear programmingMathematical Programming, 1989
- On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machinesBulletin of the American Mathematical Society, 1989
- The simplex method is not always well behavedLinear Algebra and its Applications, 1988
- A stabilization of the simplex methodNumerische Mathematik, 1971
- Error control in the simplex-techniqueBIT Numerical Mathematics, 1967
- Techniques for automatic tolerance control in linear programmingCommunications of the ACM, 1966