Round-off estimates for second-order conic feasibility problems
From MaRDI portal
Publication:447897
DOI10.1016/J.CRMA.2012.06.013zbMATH Open1248.65060OpenAlexW2002105129WikidataQ57733102 ScholiaQ57733102MaRDI QIDQ447897FDOQ447897
Authors: Felipe Cucker, Vera Roshchina, Javier 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
Recommendations
- Solving second-order conic systems with variable precision
- Complexity estimates depending on condition and round-off error
- An Interior Point Cutting Plane Method for the Convex Feasibility Problem with Second-Order Cone Inequalities
- An infeasible interior point algorithm for the second-order cone programming
- A primal-dual algorithm for solving polyhedral conic systems with a finite-precision machine
Cites Work
- Applications of second-order cone programming
- Second-order cone programming
- A convergence analysis of the scaling-invariant primal-dual path-following algorithms for second-order cone programming
- A Characterization of Stability in Linear Programming
- The simplex method is not always well behaved
- On the complexity of linear programming under finite precision arithmetic
- 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
- Error control in the simplex-technique
- Techniques for automatic tolerance control in linear programming
- Title not available (Why is that?)
Cited In (2)
This page was built for publication: Round-off estimates for second-order conic feasibility problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q447897)
