On the convergence properties of a second-order augmented Lagrangian method for nonlinear programming problems with inequality constraints
DOI10.1007/S10957-015-0842-5zbMATH Open1467.90071OpenAlexW2247931801MaRDI QIDQ831373FDOQ831373
Authors: Liang Chen, Anping Liao
Publication date: 11 May 2021
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10957-015-0842-5
Recommendations
- Convergence of the augmented Lagrangian method for nonlinear optimization problems over second-order cones
- Convergence properties of a second order augmented Lagrangian method for mathematical programs with complementarity constraints
- Convergence of an augmented Lagrange algorithm for nonlinear optimizations with second-order cone constraints
- Convergence analysis of the augmented Lagrangian method for nonlinear second-order cone optimization problems
- An inexact augmented Lagrangian method for second-order cone programming with applications
- Augmented Lagrangian method for second-order cone programs under second-order sufficiency
- An Implementable Augmented Lagrangian Method for Solving Second-Order Cone Constrained Variational Inequalities
- A second-order convergence augmented Lagrangian method using non-quadratic penalty functions
- The augmented Lagrangian method for a type of inverse quadratic programming problems over second-order cones
- On the convergence of inexact augmented Lagrangian methods for problems with convex constraints
nonlinear programmingnonsmooth analysisgeneralized Newton methodsecond-order augmented Lagrangian method
Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Nonsmooth analysis (49J52)
Cites Work
- Variational Analysis
- Title not available (Why is that?)
- Title not available (Why is that?)
- Multiplier and gradient methods
- Title not available (Why is that?)
- A nonsmooth version of Newton's method
- The multiplier method of Hestenes and Powell applied to convex programming
- A Globally Convergent Augmented Lagrangian Algorithm for Optimization with General Constraints and Simple Bounds
- Optimization and nonsmooth analysis
- Strongly Regular Generalized Equations
- Semismooth and Semiconvex Functions in Constrained Optimization
- Augmented Lagrangians and Applications of the Proximal Point Algorithm in Convex Programming
- Convergence Analysis of Some Algorithms for Solving Nonsmooth Equations
- A dual approach to solving nonlinear programming problems by unconstrained optimization
- Multiplier methods: A survey
- Newton and Quasi-Newton Methods for a Class of Nonsmooth Equations and Related Problems
- The rate of convergence of the augmented Lagrangian method for nonlinear semidefinite programming
- Constraint Nondegeneracy, Strong Regularity, and Nonsingularity in Semidefinite Programming
- Lipschitzian inverse functions, directional derivatives, and applications in \(C^{1,1}\) optimization
- An Ideal Penalty Function for Constrained Optimization
- A further result on an implicit function theorem for locally Lipschitz functions
- Title not available (Why is that?)
- Title not available (Why is that?)
- Inverse and implicit function theorems forH-differentiable and semismooth functions
- A Convergence Theory for a Class of Quasi-Newton Methods for Constrained Optimization
- On Penalty and Multiplier Methods for Constrained Minimization
- The augmented Lagrangian method for equality and inequality constraints in Hilbert spaces
- On the convergence properties of second-order multiplier methods
- Extended convergence results for the method of multipliers for nonstrictly binding inequality constraints
- Analysis on a superlinearly convergent augmented Lagrangian method
Cited In (5)
- Augmented Lagrangians with constrained subproblems and convergence to second-order stationary points
- A second-order convergence augmented Lagrangian method using non-quadratic penalty functions
- Unified convergence analysis of a second-order method of multipliers for nonlinear conic programming
- Local convergence of exact and inexact augmented Lagrangian methods under the second-order sufficient optimality condition
- The Linear and Asymptotically Superlinear Convergence Rates of the Augmented Lagrangian Method with a Practical Relative Error Criterion
This page was built for publication: On the convergence properties of a second-order augmented Lagrangian method for nonlinear programming problems with inequality constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q831373)