A characterization of ill-posed data instances for convex programming.
From MaRDI portal
Publication:5957571
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
Cited in
(8)- Ill-posedness with respect to the solvability in linear optimization
- Distance to ill-posedness and the consistency value of linear semi-infinite inequality systems
- Sufficient conditions for total ill-posedness in linear semi-infinite optimization
- Generic primal-dual solvability in continuous linear semi-infinite programming
- 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
- Characterizations of interiors of feasible and infeasible data instances and feasibility for conic linear programming
- Extreme points of well-posed polytopes
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)
