A globally and quadratically convergent primal–dual augmented Lagrangian algorithm for equality constrained optimization
From MaRDI portal
Publication:5268888
Recommendations
- scientific article; zbMATH DE number 2201293
- scientific article; zbMATH DE number 2190118
- On the local quadratic convergence of the primal–dual augmented Lagrangian method
- A Globally Convergent Augmented Lagrangian Algorithm for Optimization with General Constraints and Simple Bounds
- New augmented Lagrangian-based proximal point algorithm for convex optimization with equality constraints
- On the Convergence of Augmented Lagrangian Methods for Constrained Global Optimization
- A dual-primal balanced augmented Lagrangian method for linearly constrained convex programming
- Convergence Properties of an Augmented Lagrangian Algorithm for Optimization with a Combination of General Equality and Linear Constraints
- A globally convergent Levenberg-Marquardt method for equality-constrained optimization
- An augmented Lagrangian method for equality constrained optimization with rapid infeasibility detection capabilities
Cites work
- scientific article; zbMATH DE number 3914081 (Why is no real title available?)
- A Globally Convergent Augmented Lagrangian Algorithm for Optimization with General Constraints and Simple Bounds
- A Globally Convergent Stabilized SQP Method
- A primal-dual augmented Lagrangian
- A primal-dual regularized interior-point method for convex quadratic programs
- An Algorithm for Degenerate Nonlinear Programming with Rapid Local Convergence
- An Interior Point Method with a Primal-Dual Quadratic Barrier Penalty Function for Nonlinear Optimization
- Augmented Lagrangian methods under the constant positive linear dependence constraint qualification
- Benchmarking optimization software with performance profiles.
- From global to local convergence of interior methods for nonlinear optimization
- Interior-point \(\ell_2\)-penalty methods for nonlinear programming with strong global convergence properties
- Local convergence of exact and inexact augmented Lagrangian methods under the second-order sufficient optimality condition
- MA57---a code for the solution of sparse symmetric definite and indefinite systems
- On Augmented Lagrangian Methods with General Lower-Level Constraints
- On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
- On the local quadratic convergence of the primal–dual augmented Lagrangian method
- Practical augmented Lagrangian methods for constrained optimization
- Primal-Dual Interior Methods for Nonconvex Nonlinear Programming
- Study of a primal-dual algorithm for equality constrained minimization
- Trust Region Methods
Cited in
(17)- Rapid infeasibility detection in a mixed logarithmic barrier-augmented Lagrangian method for nonlinear optimization
- On the Convergence of Augmented Lagrangian Methods for Constrained Global Optimization
- A regularization method for constrained nonlinear least squares
- A primal-dual modified log-barrier method for inequality constrained nonlinear optimization
- A regularized factorization-free method for equality-constrained optimization
- Moreau envelope augmented Lagrangian method for nonconvex optimization with linear constraints
- A primal-dual augmented Lagrangian penalty-interior-point filter line search algorithm
- A new augmented Lagrangian method for equality constrained optimization with simple unconstrained subproblem
- Complexity and performance of an augmented Lagrangian algorithm
- A mixed logarithmic barrier-augmented Lagrangian method for nonlinear optimization
- Study of a primal-dual algorithm for equality constrained minimization
- Comparison between two augmented Lagrangian algorithms for a optimization problem with equality constraints
- On the local quadratic convergence of the primal–dual augmented Lagrangian method
- Boundedness of the inverse of a regularized Jacobian matrix in constrained optimization and applications
- An augmented Lagrangian method for equality constrained optimization with rapid infeasibility detection capabilities
- On a primal-dual Newton proximal method for convex quadratic programs
- An inexact proximal regularization method for unconstrained optimization
This page was built for publication: A globally and quadratically convergent primal–dual augmented Lagrangian algorithm for equality constrained optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5268888)