Solving second-order conic systems with variable precision

2011/04/07 by Felipe Cucker, Javier Peña, Cucker, Felipe +3
Computer Science · Mathematics · #Advanced Optimization Algorithms Research #FOS: Mathematics #Numerical Analysis (math.NA) #Numerical Methods and Algorithms #Optimization and Control (math.OC) #Polynomial and algebraic computation

paper · pdf · doi:10.48550/arxiv.1104.1352

openalex publication_date 2011/04/07 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

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.

Related

• Guaranteed Accuracy for Conic Programming Problems in Vector Lattices
• A Strict Complementarity Approach to Error Bound and Sensitivity of Solution of Conic Programs
• Conic Descent Redux for Memory-Efficient Optimization
• A First-Order Numerical Algorithm without Matrix Operations
• A data-independent distance to infeasibility for linear conic systems