Augmented Lagrangian algorithms based on the spectral projected gradient method for solving nonlinear programming problems
From MaRDI portal
Publication:1770091
Recommendations
- Algorithm 813
- Numerical comparison of augmented Lagrangian algorithms for nonconvex problems
- Inexact spectral projected gradient methods on convex sets
- Partial spectral projected gradient method with active-set strategy for linearly constrained optimization
- A Lagrangian dual spectral projected gradient method for nonconvex constrained optimization
Cites work
- A Globally Convergent Augmented Lagrangian Algorithm for Optimization with General Constraints and Simple Bounds
- A new trust region algorithm for bound constrained minimization
- A Nonmonotone Line Search Technique for Newton’s Method
- Algorithm 813
- An assessment of the preconditioned gradient method with retards for parallel computers
- Automatic differentiation and spectral projected gradient methods for optimal control problems
- Estimation of the optimal constants and the thickness of thin films using unconstrained optimization
- scientific article; zbMATH DE number 3914081 (Why is no real title available?)
- scientific article; zbMATH DE number 107545 (Why is no real title available?)
- Low cost optimization techniques for solving the nonlinear seismic reflection tomography problem
- Nonmonotone Spectral Projected Gradient Methods on Convex Sets
- Nonmonotone strategy for minimization of quadratics with simple constraints.
- On the Barzilai and Borwein choice of steplength for the gradient method
- Preconditioned spectral gradient method
- The Barzilai and Borwein Gradient Method for the Large Scale Unconstrained Minimization Problem
- Two-Point Step Size Gradient Methods
Cited in
(14)- Subspace Barzilai-Borwein gradient method for large-scale bound constrained optimization
- A convex optimization approach for solving large scale linear systems
- Augmented Lagrangian algorithms for solving the continuous nonlinear resource allocation problem
- An augmented Lagrangian algorithm for nonlinear semidefinite programming applied to the covering problem
- Augmented Lagrangian methods under the constant positive linear dependence constraint qualification
- Structured minimal-memory inexact quasi-Newton method and secant preconditioners for augmented Lagrangian optimization
- Global convergence of modified augmented Lagrangian methods for nonlinear semidefinite programming
- New insights and augmented Lagrangian algorithm for optimal portfolio liquidation with market impact
- An augmented Lagrangian approach for cardinality constrained minimization applied to variable selection problems
- An optimization study of a mathematical model of the urine concentrating mechanism of the rat kidney
- Partial spectral projected gradient method with active-set strategy for linearly constrained optimization
- Augmented penalty algorithms based on BFGS secant approximations and trust regions
- Modified subspace limited memory BFGS algorithm for large-scale bound constrained optimization
- Convergence properties of modified and partially-augmented Lagrangian methods for mathematical programs with complementarity constraints
This page was built for publication: Augmented Lagrangian algorithms based on the spectral projected gradient method for solving nonlinear programming problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1770091)
