Global Error Bounds for Convex Conic Problems
From MaRDI portal
Convex sets in (n) dimensions (including convex hypersurfaces) (52A20) Error analysis and interval analysis (65G99) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08) Interior-point methods (90C51) Abstract computational complexity for mathematical programming problems (90C60)
Recommendations
- scientific article; zbMATH DE number 1099080
- Global error bounds for systems of convex polynomials over polyhedral constraints
- scientific article; zbMATH DE number 1328979
- Global error bounds for convex multifunctions and applications
- A Lipschitzian error bound for convex quadratic symmetric cone programming
Cited in
(18)- Error bounds for infinite systems of convex inequalities without Slater's condition
- Error bounds for rank constrained optimization problems and applications
- New characterizations of Hoffman constants for systems of linear constraints
- Variational analysis perspective on linear convergence of some first order methods for nonsmooth convex optimization problems
- Error bounds for non-polyhedral convex optimization and applications to linear convergence of FDM and PGM
- A low-rank spectral method for learning Markov models
- On the finite termination of the Douglas-Rachford method for the convex feasibility problem
- A Lipschitzian error bound for convex quadratic symmetric cone programming
- scientific article; zbMATH DE number 5283371 (Why is no real title available?)
- scientific article; zbMATH DE number 1786519 (Why is no real title available?)
- scientific article; zbMATH DE number 841069 (Why is no real title available?)
- Convexity and variational analysis
- Error bounds, facial residual functions and applications to the exponential cone
- A strict complementarity approach to error bound and sensitivity of solution of conic programs
- Generalized power cones: optimal error bounds and automorphisms
- Spectrally constrained optimization
- Sharpness and conditioning of nonsmooth convex formulations in statistical signal recovery
- On a special class of regularized central paths for semidefinite programs
This page was built for publication: Global Error Bounds for Convex Conic Problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4509739)