Ill-posedness with respect to the solvability in linear optimization
The authors study extensively the notion of ill-posedness in linear optimization. The aim of the research is to characterize the linear optimization problems that are ill-posed, which is defined as those where arbitrarily small perturbations of the coefficients produce very different types of problems, e.g., bounded/unbounded or feasible/infeasible. The article begins with an overview of useful definitions common in linear optimization. The authors then define the notion of stability in linear problems and some preliminary properties are presented. The bulk of this very interesting article contains a series of theorems and lemmas with proofs, which aim to present an insight on certain conditions that may cause a particular linear problem to be ill-posed. The article finally concludes with a section on the link of the current work with related research on condition numbers associated with optimization problems.
- Ill-Posedness and the Complexity of Deciding Existence of Solutions to Linear Programs
- Characterization of total ill-posedness in linear semi-infinite optimization
- Ill-posedness in continuous linear optimization via partitions of the space of parameters
- Ill-posedness of sublinear minimization problems
- Sufficient conditions for total ill-posedness in linear semi-infinite optimization
- scientific article; zbMATH DE number 3319895
- scientific article; zbMATH DE number 3435253
- Ill-posed quadratic optimization in Banach spaces
- scientific article; zbMATH DE number 4095225
- The optimal approximations for solving linear ill-posed problems
- A characterization of ill-posed data instances for convex programming.
- A Characterization of Stability in Linear Programming
- Distance to ill-posedness and the consistency value of linear semi-infinite inequality systems
- scientific article; zbMATH DE number 3763675 (Why is no real title available?)
- scientific article; zbMATH DE number 41702 (Why is no real title available?)
- scientific article; zbMATH DE number 3501236 (Why is no real title available?)
- scientific article; zbMATH DE number 3238144 (Why is no real title available?)
- scientific article; zbMATH DE number 3365044 (Why is no real title available?)
- Recent contributions to linear semi-infinite optimization
- Solving strategies and well-posedness in linear semi-infinite programming
- Some characterizations and properties of the ``distance to the ill-posedness and the condition measure of a conic linear system
- Some perturbation theory for linear programming
- Stability and Well-Posedness in Linear Semi-Infinite Programming
- Stability Theory for Linear Inequality Systems
- Stability Theory for Systems of Inequalities. Part I: Linear Systems
- Stable parametric programming*
- Understanding the Geometry of Infeasible Perturbations of a Conic Linear System
- Unifying Condition Numbers for Linear Programming
- Recent contributions to linear semi-infinite optimization
- Recent contributions to linear semi-infinite optimization: an update
- Stability in linear optimization and related topics. A personal tour
- Marco A. López, a pioneer of continuous optimization in Spain
- Stability of the primal-dual partition in linear semi-infinite programming
- Linear ill-posed problems on sets of convex functions on two-dimensional sets
- Generic primal-dual solvability in continuous linear semi-infinite programming
- Ill-posedness in continuous linear optimization via partitions of the space of parameters
- scientific article; zbMATH DE number 1059229 (Why is no real title available?)
- Ill-Posedness and the Complexity of Deciding Existence of Solutions to Linear Programs
- LP relaxations for a class of linear semi-infinite programming problems
- Error bounds for the inverse feasible set mapping in linear semi-infinite optimization via a sensitivity dual approach
- Primal, dual and primal-dual partitions in continuous linear optimization
- Distance to Solvability/Unsolvability in Linear Optimization
- Almost Every Convex or Quadratic Programming Problem Is Well Posed
- Stability and continuity in robust optimization
- Measuring the stability. A paradigmatic problem in optimization
- Sufficient conditions for total ill-posedness in linear semi-infinite optimization
- Characterization of total ill-posedness in linear semi-infinite optimization
This page was built for publication: Ill-posedness with respect to the solvability in linear optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2496624)
