Structured minimal-memory inexact quasi-Newton method and secant preconditioners for augmented Lagrangian optimization
From MaRDI portal
Publication:2479826
DOI10.1007/s10589-007-9050-zzbMath1147.90412OpenAlexW2063958776MaRDI QIDQ2479826
Ernesto G. Birgin, José Mario Martínez
Publication date: 3 April 2008
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10589-007-9050-z
Nonlinear programming (90C30) Numerical computation of solutions to systems of equations (65H10) Methods of quasi-Newton type (90C53)
Related Items
The boundedness of penalty parameters in an augmented Lagrangian method with constrained subproblems, Second-order negative-curvature methods for box-constrained and general constrained optimization, On the Barzilai–Borwein gradient methods with structured secant equation for nonlinear least squares problems, Finding graph embeddings by incremental low-rank semidefinite programming, Partial spectral projected gradient method with active-set strategy for linearly constrained optimization, New and improved results for packing identical unitary radius circles within triangles, rectangles and strips, On the use of third-order models with fourth-order regularization for unconstrained optimization, Minimizing the object dimensions in circle and sphere packing problems, Inverse-free recursive multiresolution algorithms for a data approximation problem, A practical method for solving large-scale TRS, Continuous GRASP with a local active-set method for bound-constrained global optimization, ALGENCAN, A modified Levenberg-Marquardt method for nonsmooth equations with finitely many maximum functions, A Shape Optimization Approach to the Problem of Covering a Two-Dimensional Region with Minimum-Radius Identical Balls, Complexity and performance of an Augmented Lagrangian algorithm
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Analysis and implementation of a dual algorithm for constrained optimization
- Validation of an augmented Lagrangian algorithm with a Gauss-Newton Hessian approximation using a set of hard-spheres problems
- Augmented Lagrangian algorithms based on the spectral projected gradient method for solving nonlinear programming problems
- On the relation between constant positive linear dependence condition and quasinormality constraint qualification
- Large-scale active-set box-constrained optimization method with spectral projected gradients
- A limited-memory multipoint symmetric secant method for bound constrained optimization
- Inexact Newton methods for solving nonsmooth equations
- A nonsmooth version of Newton's method
- Augmented Lagrangian methods under the constant positive linear dependence constraint qualification
- Numerical comparison of augmented Lagrangian algorithms for nonconvex problems
- On the asymptotic behaviour of some new gradient methods
- Multiplier and gradient methods
- The multiplier method of Hestenes and Powell applied to convex programming
- R-linear convergence of the Barzilai and Borwein gradient method
- The Barzilai and Borwein Gradient Method for the Large Scale Unconstrained Minimization Problem
- A Globally Convergent Augmented Lagrangian Algorithm for Optimization with General Constraints and Simple Bounds
- A New Active Set Algorithm for Box Constrained Optimization
- On Augmented Lagrangian Methods with General Lower-Level Constraints
- Algorithm 851
- Two-Point Step Size Gradient Methods
- Least Change Secant Updates for Quasi-Newton Methods
- Self-Scaling Variable Metric Algorithms without Line Search for Unconstrained Minimization
- Algorithm 778: L-BFGS-B
- Numerical Optimization
- CUTE
- A test for cancellation errors in quasi-Newton methods
- Augmented Lagrangians with Adaptive Precision Control for Quadratic Programming with Simple Bounds and Equality Constraints
- Inexact spectral projected gradient methods on convex sets
- On the Constant Positive Linear Dependence Condition and Its Application to SQP Methods
- Nonmonotone Spectral Projected Gradient Methods on Convex Sets
- A Limited Memory Algorithm for Bound Constrained Optimization
- On the Barzilai and Borwein choice of steplength for the gradient method
- SNOPT: An SQP Algorithm for Large-Scale Constrained Optimization
- A New Conjugate Gradient Method with Guaranteed Descent and an Efficient Line Search
- Algorithm 813
- Inexact Semimonotonic Augmented Lagrangians with Optimal Feasibility Convergence for Convex Bound and Equality Constrained Quadratic Programming
- Methods of conjugate gradients for solving linear systems
- Duality-based domain decomposition with natural coarse-space for variational inequalities
- Benchmarking optimization software with performance profiles.
