On the continuity of the optimal value in parametric linear optimization: Stable discretization of the Lagrangian dual of nonlinear problems
DOI10.1007/S11228-004-5029-4zbMATH Open1090.90184OpenAlexW1986384742MaRDI QIDQ1781003FDOQ1781003
Authors: Maria J. Cánovas, Marco Antonio López Cerdá, 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
Recommendations
- scientific article; zbMATH DE number 3900528
- Publication:3030597
- Lipschitz continuity of the optimal value function in parametric optimization
- scientific article
- Nonlinear Lagrange duality theorems and penalty function methods in continuous optimization
- Optimality conditions and Lagrangian duality in continuous-time nonlinear programming
- On the continuity of a Lagrangian multiplier function in input optimization
- Stability of discrete vector problems with the parametric principle of optimality
- Stability in disjunctive linear optimization I: continuity of the feasible set
- Continuity of the optimal value function and optimal solutions of parametric mixed-integer quadratic programs
Linear programming (90C05) Optimality conditions and duality in mathematical programming (90C46) Sensitivity, stability, parametric optimization (90C31)
Cites Work
- Optimization. Algorithms and consistent approximations
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Well-posed optimization problems
- Introduction to sensitivity and stability analysis in nonlinear programming
- Title not available (Why is that?)
- Stability Theory for Systems of Inequalities. Part I: Linear Systems
- Stable local minimizers in semi-infinite optimization: Regularity and second-order conditions
- Semi-infinite optimization: Structure and stability of the feasible set
- Discretization methods for the solution of semi-infinite programming problems
- Parametric semi-infinite linear programming I. continuity of the feasible set and of the optimal value
- Upper semicontinuity of the feasible set mapping for linear inequality systems
- Stability Theory for Linear Inequality Systems
- Stability and Well-Posedness in Linear Semi-Infinite Programming
- On Generic One-Parametric Semi-Infinite Optimization
- Convergence of selections with applications in optimization
- Pointwise versions of the maximum theorem with applications in optimization
- Topological stability of linear semi-infinite inequality systems
- Stability in the Discretization of a Parametric Semi-Infinite Convex Inequality System
- Solving strategies and well-posedness in linear semi-infinite programming
- Upper semicontinuity of closed-convex-valued multifunctions
- Stability of linear inequality systems in a parametric setting
- One-Parametric Semi-Infinite Optimization: On the Stability of the Feasible Set
- Metric regularity of the feasible set mapping in semi-infinite optimization
- Convex semi-infinite parametric programming: Uniform convergence of the optimal value functions of discretized problems
- On equivalent stability properties in semi-infinite optimization
Cited In (1)
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
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1781003)
