Generalized quadratic augmented Lagrangian methods with nonmonotone penalty parameters
From MaRDI portal
Publication:442809
DOI10.1155/2012/181629zbMath1247.65079WikidataQ58905836 ScholiaQ58905836MaRDI QIDQ442809
Xunzhi Zhu, Jin Chuan Zhou, Li-Li Pan, Wen-Ling Zhao
Publication date: 6 August 2012
Published in: Journal of Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1155/2012/181629
convergence; nonconvex optimization; multiplier algorithm; nonmonotone penalty parameters; numerical experience; quadratic augmented Lagrangian methods
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unified theory of augmented Lagrangian methods for constrained global optimization
- Convergence properties of modified and partially-augmented Lagrangian methods for mathematical programs with complementarity constraints
- Lagrange-type functions in constrained non-convex optimization.
- Pseudonormality and a Lagrange multiplier theory for constrained optimization
- Global minimization using an augmented Lagrangian method with variable lower-level constraints
- Augmented Lagrangian methods under the constant positive linear dependence constraint qualification
- A Globally Convergent Augmented Lagrangian Algorithm for Optimization with General Constraints and Simple Bounds
- On the Convergence of Augmented Lagrangian Methods for Constrained Global Optimization
- On Augmented Lagrangian Methods with General Lower-Level Constraints
- Variational Analysis
- A Globally Convergent Augmented Lagrangian Pattern Search Algorithm for Optimization with General Constraints and Simple Bounds
- Convergence Properties of an Augmented Lagrangian Algorithm for Optimization with a Combination of General Equality and Linear Constraints
- On Saddle Points of Augmented Lagrangians for Constrained Nonconvex Optimization
- Augmented Lagrange Multiplier Functions and Duality in Nonconvex Programming
- Computational discretization algorithms for functional inequality constrained optimization
- Extension of a hybrid genetic algorithm for nonlinear programming problems with equality and inequality constraints.
