Pages that link to "Item:Q5957571"
From MaRDI portal
The following pages link to A characterization of ill-posed data instances for convex programming. (Q5957571):
Displayed 8 items.
- Sufficient conditions for total ill-posedness in linear semi-infinite optimization (Q877594) (← links)
- Distance to ill-posedness and the consistency value of linear semi-infinite inequality systems (Q1777217) (← links)
- Characterizations of interiors of feasible and infeasible data instances and feasibility for conic linear programming (Q1958647) (← links)
- Ill-posedness with respect to the solvability in linear optimization (Q2496624) (← links)
- Extreme points of well-posed polytopes (Q3446581) (← links)
- Generic primal-dual solvability in continuous linear semi-infinite programming (Q3498590) (← links)
- Primal, dual and primal-dual partitions in continuous linear optimization (Q5426963) (← links)
- Stability of systems of linear equations and inequalities: distance to ill-posedness and metric regularity (Q5758204) (← links)