Stability in linear optimization and related topics. A personal tour
From MaRDI portal
Publication:1939064
DOI10.1007/s11750-011-0213-9zbMath1257.90096MaRDI QIDQ1939064
Publication date: 26 February 2013
Published in: Top (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11750-011-0213-9
stability; ill-posedness; infinitely constrained optimization; feasible and optimal set mappings; Lipschitz properties of mappings
49K40: Sensitivity, stability, well-posedness
90C31: Sensitivity, stability, parametric optimization
90C48: Programming in abstract spaces
90C34: Semi-infinite programming
Related Items
Projection: A Unified Approach to Semi-Infinite Linear Programs and Duality in Convex Programming, Stability and Continuity in Robust Optimization, On metric regularity and the boundary of the feasible set in linear optimization, On the sufficiency of finite support duals in semi-infinite linear programming, Recent contributions to linear semi-infinite optimization, Recent contributions to linear semi-infinite optimization: an update, A viscosity solution approach to regularity properties of the optimal value function, A twist on SLP algorithms for NLP and MINLP problems: an application to gas transmission networks, An Induction Theorem and Nonlinear Regularity Models
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Well-posed optimization problems
- Convexity and well-posed problems
- Distance to ill-posedness in linear optimization via the Fenchel-Legendre conjugate
- Characterization of total ill-posedness in linear semi-infinite optimization
- Stability of the intersection of solution sets of semi-infinite systems
- Lipschitz behavior of convex semi-infinite optimization problems: a variational approach
- On the stable containment of two sets
- Regularity estimates for convex multifunctions
- Stability of indices in the KKT conditions and metric regularity in convex semi-infinite optimization
- On approximate solutions of infinite systems of linear inequalities
- Nonlinear optimization: Characterization of structural stability
- The sharp Lipschitz constants for feasible and optimal solutions of a perturbed linear program
- Some perturbation theory for linear programming
- Semi-infinite optimization: Structure and stability of the feasible set
- Stability for linearly constrained optimization problems
- Nonsmooth equations in optimization. Regularity, calculus, methods and applications
- Unicity results for general linear semi-infinite optimization problems using a new concept of active constraints
- A generic result in linear semi-infinite optimization
- Condition number complexity of an elementary algorithm for computing a reliable solution of a conic linear system
- Distance to ill-posedness and the consistency value of linear semi-infinite inequality systems
- Stability of linear inequality systems in a parametric setting
- On the continuity of the optimal value in parametric linear optimization: Stable discretization of the Lagrangian dual of nonlinear problems
- On the stability of the boundary of the feasible set in linear optimization
- Upper semicontinuity of the feasible set mapping for linear inequality systems
- Linear programming, complexity theory and elementary functional analysis
- Some characterizations and properties of the ``distance to the ill-posedness and the condition measure of a conic linear system
- Regularity modulus of arbitrarily perturbed linear inequality systems
- On the stability of closed-convex-valued mappings and the associated boundaries
- Dual characterizations of set containments with strict convex inequalities
- Ill-posedness with respect to the solvability in linear optimization
- Coderivative analysis of variational systems
- Metric regularity of semi-infinite constraint systems
- Post-Optimal Analysis of Linear Semi-Infinite Programs
- On the Stability of the Feasible Set in Optimization Problems
- Parametric semi-infinite linear programming I. continuity of the feasible set and of the optimal value
- Generic primal-dual solvability in continuous linear semi-infinite programming
- Metric Regularity in Convex Semi-Infinite Optimization under Canonical Perturbations
- Variational Analysis in Semi-Infinite and Infinite Programming, I: Stability of Linear Inequality Systems of Feasible Solutions
- Subdifferential Calculus Rules in Convex Analysis: A Unifying Approach Via Pointwise Supremum Functions
- Lipschitz modulus in convex semi-infinite optimizationviad.c. functions
- Stability Theory for Linear Inequality Systems II: Upper Semicontinuity of the Solution Set Mapping
- Stability and Well-Posedness in Linear Semi-Infinite Programming
- Stability Theory for Linear Inequality Systems
- The radius of metric regularity
- On the Stability of the Extreme Point Set in Linear Optimization
- Lipschitz Continuity of the Optimal Value via Bounds on the Optimal Set in Linear Semi-Infinite Optimization
- 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
- Convex Analysis
- Point-to-Set Maps in Mathematical Programming
- On the stability of the feasible set in linear optimization
- An algorithm constructing solutions for a family of linear semi-infinite problems.
