Quasi-Newton acceleration for equality-constrained minimization

DOI10.1007/s10589-007-9090-4zbMath1153.90572OpenAlexW2090764791MaRDI QIDQ1001193

V. L. R. Lopes, José Mario Martínez, L. Ferreira-Mendonça

Publication date: 13 February 2009

Published in: Computational Optimization and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10589-007-9090-4

zbMATH Keywords

Minimization with equality constraintsOptimality systemsQuasi-Newton methods

Mathematics Subject Classification ID

Nonlinear programming (90C30) Methods of quasi-Newton type (90C53)

Uses Software

• LANCELOT
• SPG
• GALAHAD
• SNOPT
• CG_DESCENT

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Test examples for nonlinear programming codes
• Convergence of quasi-Newton matrices generated by the symmetric rank one update
• Local convergence of the symmetric rank-one iteration
• Solving nonlinear systems of equations with simple constraints
• Globally convergent inexact quasi-Newton methods for solving nonlinear systems
• Validation of an augmented Lagrangian algorithm with a Gauss-Newton Hessian approximation using a set of hard-spheres problems
• Practical quasi-Newton methods for solving nonlinear systems
• 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 primal-dual trust region algorithm for nonlinear optimization
• Inexact Newton methods for solving nonsmooth equations
• A nonsmooth version of Newton's method
• Numerical comparison of augmented Lagrangian algorithms for nonconvex problems
• Multiplier and gradient methods
• A Globally Convergent Augmented Lagrangian Algorithm for Optimization with General Constraints and Simple Bounds
• Optimal Estimation of Jacobian and Hessian Matrices That Arise in Finite Difference Calculations
• Fast secant methods for the iterative solution of large nonsymmetric linear systems
• A New Active Set Algorithm for Box Constrained Optimization
• On Augmented Lagrangian Methods with General Lower-Level Constraints
• Algorithm 851
• Comparing Algorithms for Solving Sparse Nonlinear Systems of Equations
• Numerical Optimization
• Solving nonlinear systems of equations by means of quasi-neston methods with a nonmonotone stratgy^∗
• Augmented Lagrangians with Adaptive Precision Control for Quadratic Programming with Simple Bounds and Equality Constraints
• Inexact spectral projected gradient methods on convex sets
• Discrete Newton's method with local variations for solving large-scale nonlinear systems
• A derivative-free line search and global convergence of Broyden-like method for nonlinear equations
• On the Constant Positive Linear Dependence Condition and Its Application to SQP Methods
• Nonmonotone Spectral Projected Gradient Methods on Convex Sets
• A Theoretical and Experimental Study of the Symmetric Rank-One Update
• SNOPT: An SQP Algorithm for Large-Scale Constrained Optimization
• Algorithm 813
• GALAHAD, a library of thread-safe Fortran 90 packages for large-scale nonlinear optimization
• Inexact Semimonotonic Augmented Lagrangians with Optimal Feasibility Convergence for Convex Bound and Equality Constrained Quadratic Programming
• Duality-based domain decomposition with natural coarse-space for variational inequalities