Two properties of condition numbers for convex programs via implicitly defined barrier functions
From MaRDI portal
Publication:1849258
DOI10.1007/s101070200294zbMath1014.65049MaRDI QIDQ1849258
Publication date: 1 December 2002
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s101070200294
90C35: Programming involving graphs or networks
65K05: Numerical mathematical programming methods
90C31: Sensitivity, stability, parametric optimization
90C51: Interior-point methods
65F35: Numerical computation of matrix norms, conditioning, scaling
Related Items
Computation of condition numbers for linear programming problems using Peña’s method, On two measures of problem instance complexity and their correlation with the performance of SeDuMi on second-order cone problems, Behavioral measures and their correlation with IPM iteration counts on semi-definite programming problems, A primal-dual symmetric relaxation for homogeneous conic systems