A condition-based algorithm for solving polyhedral feasibility problems

DOI10.1016/j.jco.2014.02.001zbMath1334.90070OpenAlexW1994248764MaRDI QIDQ457560

Negar Soheili, Javier F. Peña

Publication date: 29 September 2014

Published in: Journal of Complexity (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jco.2014.02.001

zbMATH Keywords

interior-point methodslinear inequalitiesGoldman-Tucker partition

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Linear programming (90C05) Interior-point methods (90C51) Complexity and performance of numerical algorithms (65Y20)

Related Items (1)

Refining the partition for multifold conic optimization problems

Cites Work

• Unnamed Item
• Unnamed Item
• On strata of degenerate polyhedral cones. I: Condition and distance to strata
• Computing approximate solutions for convex conic systems of constraints
• Condition number complexity of an elementary algorithm for computing a reliable solution of a conic linear system
• Linear programming, complexity theory and elementary functional analysis
• Condition numbers for polyhedra with real number data
• Condition
• The Relaxation Method for Solving Systems of Linear Inequalities
• Condition-Based Complexity of Convex Optimization in Conic Linear Form via the Ellipsoid Algorithm
• Condition Numbers, the Barrier Method, and the Conjugate-Gradient Method
• Understanding the Geometry of Infeasible Perturbations of a Conic Linear System
• Unifying Condition Numbers for Linear Programming
• A new condition number for linear programming

This page was built for publication: A condition-based algorithm for solving polyhedral feasibility problems