Computing approximate solutions for convex conic systems of constraints

DOI10.1007/s101070050001zbMath1002.90039OpenAlexW2034677465MaRDI QIDQ1575064

James Renegar, Juan Manuel Peña

Publication date: 3 May 2001

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s101070050001

Mathematics Subject Classification ID

Convex programming (90C25) Abstract computational complexity for mathematical programming problems (90C60) Interior-point methods (90C51) Numerical computation of matrix norms, conditioning, scaling (65F35)

Related Items

Critical angles between two convex cones. I: General theory, Extreme points of well-posed polytopes, Critical angles in polyhedral convex cones: Numerical and statistical considerations, Critical angles in random polyhedral cones, A primal-dual symmetric relaxation for homogeneous conic systems, A condition-based algorithm for solving polyhedral feasibility problems, Some preconditioners for systems of linear inequalities, Computing the radius of pointedness of a convex cone, Normality and modulability indices. II: Convex cones in Hilbert spaces, Preprocessing and Regularization for Degenerate Semidefinite Programs, Solving linear programs with finite precision. II: Algorithms, On convex cones with infinitely many critical angles, Antipodal pairs, critical pairs, and Nash angular equilibria in convex cones, Unnamed Item, Lipschitz and Hölder continuity results for some functions of cones, Searching for critical angles in a convex cone, Computation of condition numbers for linear programming problems using Peña’s method, On strata of degenerate polyhedral cones. I: Condition and distance to strata, Probabilistic analysis of the Grassmann condition number