A novel augmented Lagrangian method of multipliers for optimization with general inequality constraints
From MaRDI portal
(Redirected from Publication:5879119)
Recommendations
- An augmented Lagrangian method for equality constrained optimization with rapid infeasibility detection capabilities
- Convergence Properties of an Augmented Lagrangian Algorithm for Optimization with a Combination of General Equality and Linear Constraints
- An augmented Lagrangian trust region method for equality constrained optimization
- On the convergence of inexact augmented Lagrangian methods for problems with convex constraints
- Convergence properties of augmented Lagrangian methods for constrained global optimization
Cites work
- A dual approach to solving nonlinear programming problems by unconstrained optimization
- A Globally Convergent Augmented Lagrangian Algorithm for Optimization with General Constraints and Simple Bounds
- A globally convergent primal-dual interior-point relaxation method for nonlinear programs
- A modified barrier-augmented Lagrangian method for constrained minimization
- A nonsmooth version of Newton's method
- A null-space primal-dual interior-point algorithm for nonlinear optimization with nice convergence properties
- A primal-dual augmented Lagrangian
- A primal-dual interior-point method capable of rapidly detecting infeasibility for nonlinear programs
- A primal-dual interior-point relaxation method with global and rapidly local convergence for nonlinear programs
- A Robust Primal-Dual Interior-Point Algorithm for Nonlinear Programs
- A robust sequential quadratic programming method
- A robust SQP method for mathematical programs with linear complementarity constraints
- A sequential quadratic optimization algorithm with rapid infeasibility detection
- A Sequential Quadratic Programming Method Without A Penalty Function or a Filter for Nonlinear Equality Constrained Optimization
- A shifted primal-dual penalty-barrier method for nonlinear optimization
- An augmented Lagrangian based algorithm for distributed nonconvex optimization
- An augmented Lagrangian method for distributed optimization
- An exact primal-dual penalty method approach to warmstarting interior-point methods for linear programming
- An interior point method for nonlinear programming with infeasibility detection capabilities
- Augmented Lagrangian methods under the constant positive linear dependence constraint qualification
- Augmented Lagrangians and Applications of the Proximal Point Algorithm in Convex Programming
- Failure of global convergence for a class of interior point methods for nonlinear programming
- scientific article; zbMATH DE number 3914081 (Why is no real title available?)
- scientific article; zbMATH DE number 107545 (Why is no real title available?)
- scientific article; zbMATH DE number 3309655 (Why is no real title available?)
- Improved local convergence results for augmented Lagrangian methods in \(C^2\)-cone reducible constrained optimization
- Infeasibility Detection and SQP Methods for Nonlinear Optimization
- Interior-point \(\ell_2\)-penalty methods for nonlinear programming with strong global convergence properties
- Interior-point methods for nonconvex nonlinear programming: Regularization and warmstarts
- Lagrange Multipliers and Optimality
- Multiplier and gradient methods
- Numerical Optimization
- On Augmented Lagrangian Methods with General Lower-Level Constraints
- On Penalty and Multiplier Methods for Constrained Minimization
- On the convergence of a new trust region algorithm
- On the convergence of Newton iterations to non-stationary points
- On the linear convergence of the alternating direction method of multipliers
- On the nonergodic convergence rate of an inexact augmented Lagrangian framework for composite convex programming
- Optimization theory and methods. Nonlinear programming
- Practical augmented Lagrangian methods for constrained optimization
- Test examples for nonlinear programming codes
- Testing a Class of Methods for Solving Minimization Problems with Simple Bounds on the Variables
- The multiplier method of Hestenes and Powell applied to convex programming
Cited in
(12)- An augmented Lagrangian method for equality constrained optimization with rapid infeasibility detection capabilities
- Local convergence of the method of multipliers for variational and optimization problems under the noncriticality assumption
- An Augmented Lagrangian Method for $\ell_{1}$-Regularized Optimization Problems with Orthogonality Constraints
- Partially Augmented Lagrangian Method for Matrix Inequality Constraints
- scientific article; zbMATH DE number 2190118 (Why is no real title available?)
- An augmented Lagrangian technique for variational inequalities
- IPRQP: a primal-dual interior-point relaxation algorithm for convex quadratic programming
- Dislocation hyperbolic augmented Lagrangian algorithm for nonconvex optimization
- IPRSOCP: a primal-dual interior-point relaxation algorithm for second-order cone programming
- An adaptive cubic regularisation algorithm based on interior-point methods for optimization with general inequality constraints
- An augmented Lagrangian algorithm for multi-objective optimization
- The augmented Lagrangian method for equality and inequality constraints in Hilbert spaces
This page was built for publication: A novel augmented Lagrangian method of multipliers for optimization with general inequality constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5879119)
