Computing approximate solutions for convex conic systems of constraints
From MaRDI portal
Publication:1575064
DOI10.1007/s101070050001zbMath1002.90039MaRDI 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
90C25: Convex programming
90C60: Abstract computational complexity for mathematical programming problems
90C51: Interior-point methods
65F35: Numerical computation of matrix norms, conditioning, scaling
Related Items
Antipodal pairs, critical pairs, and Nash angular equilibria in convex cones, Computation of condition numbers for linear programming problems using Peña’s method, On convex cones with infinitely many critical angles, Critical angles in random polyhedral cones, Critical angles in polyhedral convex cones: Numerical and statistical considerations, A primal-dual symmetric relaxation for homogeneous conic systems, Searching for critical angles in a convex cone, On strata of degenerate polyhedral cones. I: Condition and distance to strata, Computing the radius of pointedness of a convex cone, Normality and modulability indices. II: Convex cones in Hilbert spaces, Solving linear programs with finite precision. II: Algorithms, Extreme points of well-posed polytopes
