Global Error Bounds for Convex Conic Problems
From MaRDI portal
Publication:4509739
DOI10.1137/S105262349834429XzbMath0997.90101MaRDI QIDQ4509739
Publication date: 19 October 2000
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Abstract computational complexity for mathematical programming problems (90C60) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08) Interior-point methods (90C51) Convex sets in (n) dimensions (including convex hypersurfaces) (52A20) Error analysis and interval analysis (65G99)
Related Items (10)
A Lipschitzian error bound for convex quadratic symmetric cone programming ⋮ On a special class of regularized central paths for semidefinite programs ⋮ A low-rank spectral method for learning Markov models ⋮ A strict complementarity approach to error bound and sensitivity of solution of conic programs ⋮ Convexity and Variational Analysis ⋮ New characterizations of Hoffman constants for systems of linear constraints ⋮ Error bounds for non-polyhedral convex optimization and applications to linear convergence of FDM and PGM ⋮ Error bounds for rank constrained optimization problems and applications ⋮ Variational analysis perspective on linear convergence of some first order methods for nonsmooth convex optimization problems ⋮ On the finite termination of the Douglas-Rachford method for the convex feasibility problem
This page was built for publication: Global Error Bounds for Convex Conic Problems
