Numerical comparison of augmented Lagrangian algorithms for nonconvex problems
From MaRDI portal
Recommendations
- Improving ultimate convergence of an augmented Lagrangian method
- On the convergence of augmented Lagrangian strategies for nonlinear programming
- Augmented Lagrangian duality and nondifferentiable optimization methods in nonconvex programming
- Augmented Lagrangian applied to convex quadratic problems
- A practical relative error criterion for augmented Lagrangians
Cites work
- A generalized Lagrangian function and multiplier method
- A Globally Convergent Augmented Lagrangian Algorithm for Optimization with General Constraints and Simple Bounds
- A nonlinear programming algorithm based on non-coercive penalty functions
- Algorithm 813
- An algorithm for solving nonlinear programming problems subject to nonlinear inequality constraints
- Analysis and implementation of a dual algorithm for constrained optimization
- Augmented Lagrangians with adaptive precision control for quadratic programming with equality constraints
- Augmented Lagrangians with Adaptive Precision Control for Quadratic Programming with Simple Bounds and Equality Constraints
- Benchmarking optimization software with performance profiles.
- Combined Primal–Dual and Penalty Methods for Convex Programming
- Dual techniques for constrained optimization
- scientific article; zbMATH DE number 3914081 (Why is no real title available?)
- scientific article; zbMATH DE number 1243473 (Why is no real title available?)
- scientific article; zbMATH DE number 3309655 (Why is no real title available?)
- Interior Proximal and Multiplier Methods Based on Second Order Homogeneous Kernels
- Large-scale active-set box-constrained optimization method with spectral projected gradients
- Log-sigmoid multipliers method in constrained optimization
- Multiplier and gradient methods
- Nonlinear rescaling and proximal-like methods in convex optimization
- Nonmonotone Spectral Projected Gradient Methods on Convex Sets
- Numerical Optimization
- Penalty/Barrier Multiplier Methods for Convex Programming Problems
- Proximal Minimization Methods with Generalized Bregman Functions
- Solution of contact problems by FETI domain decomposition with natural coarse space projections
- Strict convex regularizations, proximal points and augmented lagrangians
- The Fritz John necessary optimality conditions in the presence of equality and inequality constraints
- The multiplier method of Hestenes and Powell applied to convex programming
Cited in
(56)- Quasi-Newton acceleration for equality-constrained minimization
- The global convergence of augmented Lagrangian methods based on NCP function in constrained nonconvex optimization
- Validation of an augmented Lagrangian algorithm with a Gauss-Newton Hessian approximation using a set of hard-spheres problems
- An example comparing the standard and safeguarded augmented Lagrangian methods
- An augmented Lagrange method for elliptic state constrained optimal control problems
- Augmented Lagrangian algorithms based on the spectral projected gradient method for solving nonlinear programming problems
- On the convergence of augmented Lagrangian methods for nonlinear semidefinite programming
- A hybrid differential dynamic programming algorithm for constrained optimal control problems. I: Theory
- An augmented Lagrangian algorithm for solving semiinfinite programming
- Global minimization using an augmented Lagrangian method with variable lower-level constraints
- Convergence analysis of modified \(p\)th power Lagrangian algorithms with alternative updating strategies for constrained nonconvex optimization
- On the best achievable quality of limit points of augmented Lagrangian schemes
- Moreau envelope augmented Lagrangian method for nonconvex optimization with linear constraints
- On the use of third-order models with fourth-order regularization for unconstrained optimization
- Iteration complexity of inexact augmented Lagrangian methods for constrained convex programming
- On the convergence properties of modified augmented Lagrangian methods for mathematical programming with complementarity constraints
- On saddle points in semidefinite optimization via separation scheme
- CUTEst: a constrained and unconstrained testing environment with safe threads for mathematical optimization
- Optimality properties of an augmented Lagrangian method on infeasible problems
- An inexact restoration strategy for the globalization of the sSQP method
- A second-order convergence augmented Lagrangian method using non-quadratic penalty functions
- Augmented Lagrangian methods under the constant positive linear dependence constraint qualification
- Minimizing the object dimensions in circle and sphere packing problems
- Structured minimal-memory inexact quasi-Newton method and secant preconditioners for augmented Lagrangian optimization
- Orthogonal packing of rectangular items within arbitrary convex regions by nonlinear optimization
- An augmented Lagrangian ant colony based method for constrained optimization
- Convergence results of an augmented Lagrangian method using the exponential penalty function
- New and improved results for packing identical unitary radius circles within triangles, rectangles and strips
- Augmented Lagrangian Objective Penalty Function
- The boundedness of penalty parameters in an augmented Lagrangian method with constrained subproblems
- A nonmonotone filter SQP method: local convergence and numerical results
- A Deflected Subgradient Method Using a General Augmented Lagrangian Duality with Implications on Penalty Methods
- Numerical study of augmented Lagrangian algorithms for constrained global optimization
- Improving ultimate convergence of an augmented Lagrangian method
- A sequential optimality condition related to the quasi-normality constraint qualification and its algorithmic consequences
- A sharp augmented Lagrangian-based method in constrained non-convex optimization
- Primal-dual active-set methods for large-scale optimization
- Canonical duality for solving general nonconvex constrained problems
- Local convergence of an augmented Lagrangian method for matrix inequality constrained programming
- An augmented Lagrangian fish swarm based method for global optimization
- Complexity and performance of an augmented Lagrangian algorithm
- Dislocation hyperbolic augmented Lagrangian algorithm for nonconvex optimization
- New convergence properties of the primal augmented Lagrangian method
- An empirical quantile estimation approach for chance-constrained nonlinear optimization problems
- Convergence analysis of primal-dual augmented Lagrangian methods and duality theory
- Global convergence of dislocation hyperbolic augmented Lagrangian algorithm for nonconvex optimization
- Enhancing sharp augmented Lagrangian methods with smoothing techniques for nonlinear programming
- A unified approach for smoothing approximations to the exact _1-penalty for inequality-constrained optimization
- On the global convergence of a general class of augmented Lagrangian methods
- The augmented Lagrangian methods: overview and recent advances
- Augmented Lagrangians with possible infeasibility and finite termination for global nonlinear programming
- Augmented Lagrangian methods for nonlinear programming with possible infeasibility
- Partial spectral projected gradient method with active-set strategy for linearly constrained optimization
- Separation approach for augmented lagrangians in Constrained nonconvex optimization
- Proximal methods for nonlinear programming: Double regularization and inexact subproblems
- Convergence properties of modified and partially-augmented Lagrangian methods for mathematical programs with complementarity constraints
This page was built for publication: Numerical comparison of augmented Lagrangian algorithms for nonconvex problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2487472)
