Unified theory of augmented Lagrangian methods for constrained global optimization
From MaRDI portal
Publication:839330
DOI10.1007/s10898-008-9347-1zbMath1192.90149OpenAlexW2002987466WikidataQ57445468 ScholiaQ57445468MaRDI QIDQ839330
Publication date: 2 September 2009
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-008-9347-1
Nonconvex programming, global optimization (90C26) Optimality conditions and duality in mathematical programming (90C46)
Related Items
Stochastic filter methods for generally constrained global optimization ⋮ Convergence of a class of penalty methods for constrained scalar set-valued optimization ⋮ Global saddle points of nonlinear augmented Lagrangian functions ⋮ A DIRECT-type approach for derivative-free constrained global optimization ⋮ On the convergence of augmented Lagrangian methods for nonlinear semidefinite programming ⋮ Dislocation hyperbolic augmented Lagrangian algorithm for nonconvex optimization ⋮ Some results on augmented Lagrangians in constrained global optimization via image space analysis ⋮ Generalized quadratic augmented Lagrangian methods with nonmonotone penalty parameters ⋮ New convergence properties of the primal augmented Lagrangian method ⋮ The alternating direction method of multipliers for finding the distance between ellipsoids ⋮ An approach to constrained global optimization based on exact penalty functions ⋮ Saddle points of general augmented Lagrangians for constrained nonconvex optimization ⋮ Augmented Lagrangian functions for cone constrained optimization: the existence of global saddle points and exact penalty property ⋮ Augmented Lagrangian methods for nonlinear programming with possible infeasibility ⋮ Filter-based stochastic algorithm for global optimization ⋮ A derivative-free algorithm for constrained global optimization based on exact penalty functions ⋮ An artificial fish swarm algorithm based hyperbolic augmented Lagrangian method ⋮ Convergence results of an augmented Lagrangian method using the exponential penalty function
Cites Work
- Unnamed Item
- Unnamed Item
- On the convergence of the exponential multiplier method for convex programming
- Primal-dual nonlinear rescaling method for convex optimization
- Modified barrier functions (theory and methods)
- A modified barrier-augmented Lagrangian method for constrained minimization
- Local saddle points and convexification for nonconvex optimization problems
- Lagrange-type functions in constrained non-convex optimization.
- Nonlinear rescaling vs. smoothing technique in convex optimization
- Further study on augmented Lagrangian duality theory
- Iterative determination of parameters for an exact penalty function
- Zero duality gap for a class of nonconvex optimization problems
- Local convexification of the Lagrangian function in nonconvex optimization
- Primal-dual nonlinear rescaling method with dynamic scaling parameter update
- Multiplier and gradient methods
- A Nonlinear Lagrangian Approach to Constrained Optimization Problems
- An Augmented Lagrangian Function with Improved Exactness Properties
- Lagrange Multipliers and Optimality
- A Globally Convergent Augmented Lagrangian Algorithm for Optimization with General Constraints and Simple Bounds
- An exact penalty function method with global convergence properties for nonlinear programming problems
- Augmented Lagrangians and Applications of the Proximal Point Algorithm in Convex Programming
- Ill-Conditioning and Computational Error in Interior Methods for Nonlinear Programming
- Penalty/Barrier Multiplier Methods for Convex Programming Problems
- Saddle point generation in nonlinear nonconvex optimization
- Exact Penalty Functions in Constrained Optimization
- A dual approach to solving nonlinear programming problems by unconstrained optimization
- On Saddle Points of Augmented Lagrangians for Constrained Nonconvex Optimization
- The Zero Duality Gap Property and Lower Semicontinuity of the Perturbation Function
- A Unified Augmented Lagrangian Approach to Duality and Exact Penalization
- Log-sigmoid multipliers method in constrained optimization