A primal-dual augmented Lagrangian
From MaRDI portal
Publication:434173
DOI10.1007/s10589-010-9339-1zbMath1244.90219OpenAlexW2050267927MaRDI QIDQ434173
Daniel P. Robinson, Philip E. Gill
Publication date: 10 July 2012
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10589-010-9339-1
sequential quadratic programmingnonlinear programmingaugmented Lagrangian methodsprimal-dual methodsbound constrained Lagrangian methodslinearly constrained Lagrangian methodsnonlinear constraints
Related Items
A mixed logarithmic barrier-augmented Lagrangian method for nonlinear optimization, Globalizing stabilized sequential quadratic programming method by smooth primal-dual exact penalty function, Efficient projection onto a low-dimensional ball, A primal-dual augmented Lagrangian penalty-interior-point filter line search algorithm, Shifted L-BFGS systems, Combining stabilized SQP with the augmented Lagrangian algorithm, A Nonmonotone Filter SQP Method: Local Convergence and Numerical Results, Framework for segmented threshold \(\ell_0\) gradient approximation based network for sparse signal recovery, Constrained composite optimization and augmented Lagrangian methods, Distributed optimal control of nonlinear systems using a second-order augmented Lagrangian method, Study of a primal-dual algorithm for equality constrained minimization, Primal-dual active-set methods for large-scale optimization, A stabilized SQP method: superlinear convergence, Subspace-stabilized sequential quadratic programming, The Lagrange method and SAO with bounds on the dual variables, An interior point-proximal method of multipliers for convex quadratic programming, Augmented Lagrangian Objective Penalty Function, An Augmented Lagrangian Based Algorithm for Distributed NonConvex Optimization, A globally convergent primal-dual interior-point relaxation method for nonlinear programs, Critical Lagrange multipliers: what we currently know about them, how they spoil our lives, and what we can do about it, Comments on: Critical Lagrange multipliers: what we currently know about them, how they spoil our lives, and what we can do about it, A globally and quadratically convergent primal–dual augmented Lagrangian algorithm for equality constrained optimization, On a primal-dual Newton proximal method for convex quadratic programs, A novel augmented Lagrangian method of multipliers for optimization with general inequality constraints
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The nonlinear programming method of Wilson, Han, and Powell with an augmented Lagrangian type line search function. I. Convergence analysis
- The nonlinear programming method of Wilson, Han, and Powell with an augmented Lagrangian type line search function. II. An efficient implementation with linear least squares subproblems
- A globally convergent method for nonlinear programming
- Diagonalized multiplier methods and quasi-Newton methods for constrained optimization
- Stabilized sequential quadratic programming
- A primal-dual trust region algorithm for nonlinear optimization
- The Fritz John necessary optimality conditions in the presence of equality and inequality constraints
- Multiplier and gradient methods
- Thevenin decomposition and large-scale optimization
- On the Accurate Determination of Search Directions for Simple Differentiable Penalty Functions
- On the convergence of a sequential quadratic programming method with an augmented lagrangian line search function
- A Second Derivative SQP Method: Global Convergence
- A Second Derivative SQP Method: Local Convergence and Practical Issues
- A Globally Convergent Augmented Lagrangian Algorithm for Optimization with General Constraints and Simple Bounds
- Flexible penalty functions for nonlinear constrained optimization
- A Family of Descent Functions for Constrained Optimization
- A Convergence Theory for a Class of Quasi-Newton Methods for Constrained Optimization
- A New Class of Augmented Lagrangians in Nonlinear Programming
- A projected Lagrangian algorithm and its implementation for sparse nonlinear constraints
- An SQP Augmented Lagrangian BFGS Algorithm for Constrained Optimization
- Monotone Operators and the Proximal Point Algorithm
- Augmented Lagrangians and Applications of the Proximal Point Algorithm in Convex Programming
- Primal-Dual Interior Methods for Nonconvex Nonlinear Programming
- Numerical Optimization
- CUTE
- Trust Region Methods
- A Global Convergence Analysis of an Algorithm for Large-Scale Nonlinear Optimization Problems
- Interior Methods for Nonlinear Optimization
- Newton Methods for Large-Scale Linear Equality-Constrained Minimization
- SNOPT: An SQP Algorithm for Large-Scale Constrained Optimization
- An Algorithm for Degenerate Nonlinear Programming with Rapid Local Convergence
- A Globally Convergent Linearly Constrained Lagrangian Method for Nonlinear Optimization
- CUTEr and SifDec
- On the Relative Efficiencies of Gradient Methods
- A quadratically-convergent algorithm for general nonlinear programming problems
- Properties of the Log-Barrier Function on Degenerate Nonlinear Programs
