Limited memory quasi-Newton method for large-scale linearly equality-constrained minimization

DOI10.1007/BF02679897zbMath0985.90069MaRDI QIDQ1582578

Qin Ni

Publication date: 15 October 2000

Published in: Acta Mathematicae Applicatae Sinica. English Series (Search for Journal in Brave)

zbMATH Keywords

quasi-Newton methodlarge-scale problemlimited mermorylinearly equality-constrained optimization

Mathematics Subject Classification ID

Large-scale problems in mathematical programming (90C06) Methods of quasi-Newton type (90C53)

Related Items (2)

A new class of supermemory gradient methods ⋮ Structure-preserving algorithms for a class of dynamical systems

Cites Work

• Test examples for nonlinear programming codes
• Representations of quasi-Newton matrices and their use in limited memory methods
• An unconstrained optimization technique for large-scale linearly constrained convex minimization problems
• On the convergence of a sequential quadratic programming method with an augmented lagrangian line search function
• Newton Methods For Large-Scale Linear Inequality-Constrained Minimization
• Superlinearly convergent variable metric algorithms for general nonlinear programming problems
• On the Resolution of Linearly Constrained Convex Minimization Problems
• A subspace limited memory quasi-Newton algorithm for large-scale nonlinear bound constrained optimization
• Newton Methods for Large-Scale Linear Equality-Constrained Minimization

This page was built for publication: Limited memory quasi-Newton method for large-scale linearly equality-constrained minimization