Round-off estimates for second-order conic feasibility problems
From MaRDI portal
Publication:447897
DOI10.1016/j.crma.2012.06.013zbMath1248.65060WikidataQ57733102 ScholiaQ57733102MaRDI QIDQ447897
Felipe Cucker, Vera Roshchina, Javier F. Peña
Publication date: 30 August 2012
Published in: Comptes Rendus. Mathématique. Académie des Sciences, Paris (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.crma.2012.06.013
Cites Work
- Unnamed Item
- The simplex method is not always well behaved
- Applications of second-order cone programming
- On the complexity of linear programming under finite precision arithmetic
- Second-order cone programming
- Linear programming, complexity theory and elementary functional analysis
- Solving second-order conic systems with variable precision
- Solving linear programs with finite precision. II: Algorithms
- A stabilization of the simplex method
- A Primal-Dual Algorithm for Solving Polyhedral Conic Systems with a Finite-Precision Machine
- A Characterization of Stability in Linear Programming
- A convergence analysis of the scaling-invariant primal-dual path-following algorithms for second-order cone programming
- Error control in the simplex-technique
- Techniques for automatic tolerance control in linear programming