On the continuity of the optimal value in parametric linear optimization: Stable discretization of the Lagrangian dual of nonlinear problems
From MaRDI portal
Publication:1781003
DOI10.1007/s11228-004-5029-4zbMath1090.90184OpenAlexW1986384742MaRDI QIDQ1781003
Marco A. López, Maria J. Cánovas, Juan Parra
Publication date: 15 June 2005
Published in: Set-Valued Analysis (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11228-004-5029-4
Optimality conditions and duality in mathematical programming (90C46) Sensitivity, stability, parametric optimization (90C31) Linear programming (90C05)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Well-posed optimization problems
- Introduction to sensitivity and stability analysis in nonlinear programming
- Convergence of selections with applications in optimization
- Pointwise versions of the maximum theorem with applications in optimization
- Convex semi-infinite parametric programming: Uniform convergence of the optimal value functions of discretized problems
- Discretization methods for the solution of semi-infinite programming problems
- Metric regularity of the feasible set mapping in semi-infinite optimization
- Semi-infinite optimization: Structure and stability of the feasible set
- Optimization. Algorithms and consistent approximations
- Upper semicontinuity of closed-convex-valued multifunctions
- Stability of linear inequality systems in a parametric setting
- Upper semicontinuity of the feasible set mapping for linear inequality systems
- Stable local minimizers in semi-infinite optimization: Regularity and second-order conditions
- Topological stability of linear semi-infinite inequality systems
- Parametric semi-infinite linear programming I. continuity of the feasible set and of the optimal value
- Stability Theory for Systems of Inequalities. Part I: Linear Systems
- One-Parametric Semi-Infinite Optimization: On the Stability of the Feasible Set
- On Generic One-Parametric Semi-Infinite Optimization
- Stability and Well-Posedness in Linear Semi-Infinite Programming
- Stability Theory for Linear Inequality Systems
- On equivalent stability properties in semi-infinite optimization
- Stability in the Discretization of a Parametric Semi-Infinite Convex Inequality System
- Solving strategies and well-posedness in linear semi-infinite programming
This page was built for publication: On the continuity of the optimal value in parametric linear optimization: Stable discretization of the Lagrangian dual of nonlinear problems
