Solving second-order conic systems with variable precision
DOI10.1007/S10107-014-0767-ZzbMATH Open1309.90076arXiv1104.1352OpenAlexW2050804020WikidataQ57733080 ScholiaQ57733080MaRDI QIDQ2340331FDOQ2340331
Authors: Felipe Cucker, Vera Roshchina, Javier Peña
Publication date: 16 April 2015
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1104.1352
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
Convex programming (90C25) Interior-point methods (90C51) Roundoff error (65G50) Interval and finite arithmetic (65G30)
Cites Work
Cited In (6)
- 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
- On the centralization of the circumcentered-reflection method
Uses Software
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)