Solving second-order conic systems with variable precision
From MaRDI portal
Publication:2340331
Abstract: We describe and analyze an interior-point method to decide feasibility problems of second-order conic systems. A main feature of our algorithm is that arithmetic operations are performed with finite precision. Bounds for both the number of arithmetic operations and the finest precision required are exhibited.
Recommendations
- Round-off estimates for second-order conic feasibility problems
- A primal-dual algorithm for solving polyhedral conic systems with a finite-precision machine
- An infeasible interior point algorithm for the second-order cone programming
- Solving linear programs with finite precision. II: Algorithms
- An Interior Point Cutting Plane Method for the Convex Feasibility Problem with Second-Order Cone Inequalities
Cites work
Cited in
(6)- On the centralization of the circumcentered-reflection method
- Solving Natural Conic Formulations with Hypatia.jl
- An extension of Chubanov's polynomial-time linear programming algorithm to second-order cone programming
- Round-off estimates for second-order conic feasibility problems
- On the circumcentered-reflection method for the convex feasibility problem
- A primal-dual algorithm for solving polyhedral conic systems with a finite-precision machine
This page was built for publication: Solving second-order conic systems with variable precision
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2340331)