A characterization of ill-posed data instances for convex programming.
From MaRDI portal
Publication:5957571
DOI10.1007/S101070100265zbMATH Open1049.90059OpenAlexW2078714267MaRDI QIDQ5957571FDOQ5957571
Authors: Manuel Núñez 
Publication date: 2002
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s101070100265
Recommendations
- Proximal interior point approach in convex programming (ill-posed problems)*†
- Solution of ill-posed nonconvex optimization problems with accuracy proportional to the error in input data
- Characterizing robust solution sets of convex programs under data uncertainty
- Ill-conditioned convex processes and conic linear systems.
- Iteration methods for convexly constrained ill-posed problems in hilbert space
- scientific article; zbMATH DE number 3961355
- Characterizations of robust solution for convex optimization problems with data uncertainty
- A Fast Data-Driven Iteratively Regularized Method with Convex Penalty for Solving Ill-Posed Problems
- scientific article; zbMATH DE number 3956824
Convex programming (90C25) Sensitivity, stability, parametric optimization (90C31) Abstract computational complexity for mathematical programming problems (90C60)
Cited In (8)
- Distance to ill-posedness and the consistency value of linear semi-infinite inequality systems
- Stability of systems of linear equations and inequalities: distance to ill-posedness and metric regularity
- Primal, dual and primal-dual partitions in continuous linear optimization
- Extreme points of well-posed polytopes
- Sufficient conditions for total ill-posedness in linear semi-infinite optimization
- Ill-posedness with respect to the solvability in linear optimization
- Characterizations of interiors of feasible and infeasible data instances and feasibility for conic linear programming
- Generic primal-dual solvability in continuous linear semi-infinite programming
This page was built for publication: A characterization of ill-posed data instances for convex programming.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5957571)
