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-4MaRDI QIDQ1781003zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

discretizationstabilityoptimal value functionLagrangian duality

Mathematics Subject Classification ID

Linear programming (90C05) Optimality conditions and duality in mathematical programming (90C46) Sensitivity, stability, parametric optimization (90C31)

Recommendations

• scientific article; zbMATH DE number 3900528
• Publication:3030597
• Lipschitz continuity of the optimal value function in parametric optimization
• scientific article; zbMATH DE number 7403864
• 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

Cites work

• scientific article; zbMATH DE number 417962 (Why is no real title available?)
• scientific article; zbMATH DE number 1186924 (Why is no real title available?)
• scientific article; zbMATH DE number 490143 (Why is no real title available?)
• scientific article; zbMATH DE number 1070896 (Why is no real title available?)
• Convergence of selections 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
• Introduction to sensitivity and stability analysis in nonlinear programming
• Metric regularity of the feasible set mapping in semi-infinite optimization
• On Generic One-Parametric Semi-Infinite Optimization
• On equivalent stability properties in semi-infinite optimization
• One-Parametric Semi-Infinite Optimization: On the Stability of the Feasible Set
• Optimization. Algorithms and consistent approximations
• Parametric semi-infinite linear programming I. continuity of the feasible set and of the optimal value
• Pointwise versions of the maximum theorem with applications in optimization
• Semi-infinite optimization: Structure and stability of the feasible set
• Solving strategies and well-posedness in linear semi-infinite programming
• Stability Theory for Linear Inequality Systems
• Stability Theory for Systems of Inequalities. Part I: Linear Systems
• Stability and Well-Posedness in Linear Semi-Infinite Programming
• Stability in the Discretization of a Parametric Semi-Infinite Convex Inequality System
• Stability of linear inequality systems in a parametric setting
• Stable local minimizers in semi-infinite optimization: Regularity and second-order conditions
• Topological stability of linear semi-infinite inequality systems
• Upper semicontinuity of closed-convex-valued multifunctions
• Upper semicontinuity of the feasible set mapping for linear inequality systems
• Well-posed optimization problems

Cited in

(1)

• Stability in linear optimization and related topics. A personal tour

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)