Round-off estimates for second-order conic feasibility problems
From MaRDI portal
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
- scientific article; zbMATH DE number 3276117 (Why is no real title available?)
- A Characterization of Stability in Linear Programming
- A convergence analysis of the scaling-invariant primal-dual path-following algorithms for second-order cone programming
- A primal-dual algorithm for solving polyhedral conic systems with a finite-precision machine
- A stabilization of the simplex method
- Applications of second-order cone programming
- Error control in the simplex-technique
- Linear programming, complexity theory and elementary functional analysis
- On the complexity of linear programming under finite precision arithmetic
- Second-order cone programming
- Solving linear programs with finite precision. II: Algorithms
- Solving second-order conic systems with variable precision
- Techniques for automatic tolerance control in linear programming
- The simplex method is not always well behaved
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)
