Duality and exact penalization for general augmented Lagrangians
From MaRDI portal
Publication:607892
DOI10.1007/s10957-010-9711-4zbMath1211.90284OpenAlexW2031151776WikidataQ58048469 ScholiaQ58048469MaRDI QIDQ607892
Regina Sandra Burachik, Alfredo Noel Iusem, Jefferson G. Melo
Publication date: 6 December 2010
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10957-010-9711-4
Related Items (18)
Generalized Lagrangian duality in set-valued vector optimization via abstract subdifferential ⋮ A primal–dual penalty method via rounded weighted-ℓ1 Lagrangian duality ⋮ A regularization method based on level sets and augmented Lagrangian for parameter identification problems with piecewise constant solutions ⋮ Global saddle points of nonlinear augmented Lagrangian functions ⋮ Existence of augmented Lagrange multipliers: reduction to exact penalty functions and localization principle ⋮ An inexact modified subgradient algorithm for primal-dual problems via augmented Lagrangians ⋮ A hybrid epigraph directions method for nonsmooth and nonconvex constrained optimization via generalized augmented Lagrangian duality and a genetic algorithm ⋮ An augmented penalty function method with penalty parameter updates for nonconvex optimization ⋮ An approximate exact penalty in constrained vector optimization on metric spaces ⋮ Augmented Lagrangian functions for constrained optimization problems ⋮ Interior epigraph directions method for nonsmooth and nonconvex optimization via generalized augmented Lagrangian duality ⋮ An approximate exact penalty for vector inequality-constrained minimization problems ⋮ Exact augmented Lagrangian duality for mixed integer linear programming ⋮ Augmented Lagrangian functions for cone constrained optimization: the existence of global saddle points and exact penalty property ⋮ Existence of augmented Lagrange multipliers for cone constrained optimization problems ⋮ The exact penalty map for nonsmooth and nonconvex optimization ⋮ Exact Augmented Lagrangian Duality for Mixed Integer Quadratic Programming ⋮ Nonlinear separation in the image space with applications to penalty methods
Cites Work
- An augmented Lagrangian approach with a variable transformation in nonlinear programming
- Duality and penalization in optimization via an augmented Lagrangian function with applications
- Lagrange-type functions in constrained non-convex optimization.
- Nonlinear Lagrange duality theorems and penalty function methods in continuous optimization
- Modified Lagrangian and least root approaches for general nonlinear optimization problems
- On the absence of duality gap for Lagrange-type functions
- Unified nonlinear Lagrangian approach to duality and optimal paths
- A geometric framework for nonconvex optimization duality using augmented Lagrangian functions
- Abstract Convexity and Augmented Lagrangians
- Multipliers and general Lagrangians
- Abstract convexity for nonconvex optimization duality
- The Zero Duality Gap Property and Lower Semicontinuity of the Perturbation Function
- A Unified Augmented Lagrangian Approach to Duality and Exact Penalization
- Abstract convexity and global optimization
This page was built for publication: Duality and exact penalization for general augmented Lagrangians
