A characterization of ill-posed data instances for convex programming.

DOI10.1007/s101070100265zbMath1049.90059OpenAlexW2078714267MaRDI QIDQ5957571

Manuel A. Nunez

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

zbMATH Keywords

linear conic systemsperturbation of convex programstheorems of the alternative

Mathematics Subject Classification ID

Convex programming (90C25) Abstract computational complexity for mathematical programming problems (90C60) Sensitivity, stability, parametric optimization (90C31)

Related Items

Extreme points of well-posed polytopes ⋮ Sufficient conditions for total ill-posedness in linear semi-infinite optimization ⋮ Generic primal-dual solvability in continuous linear semi-infinite programming ⋮ Characterizations of interiors of feasible and infeasible data instances and feasibility for conic linear programming ⋮ Primal, dual and primal-dual partitions in continuous linear optimization ⋮ Ill-posedness with respect to the solvability in linear optimization ⋮ 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