A note about sparsity exploiting quasi-Newton updates

DOI10.1007/BF01584238zbMath0463.90081OpenAlexW1993009357WikidataQ58185987 ScholiaQ58185987MaRDI QIDQ3914773

Phillipe L. Toint

Publication date: 1981

Published in: Mathematical Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01584238

zbMATH Keywords

unconstrained optimizationquasi-Newton updatessparsitymatrix updatingFrobenius projection

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30)

Related Items

Using the KKT matrix in an augmented Lagrangian SQP method for sparse constrained optimization, Broyden's quasi-Newton methods for a nonlinear system of equations and unconstrained optimization: a review and open problems, Multilevel Objective-Function-Free Optimization with an Application to Neural Networks Training, Partitioned variable metric updates for large structured optimization problems, Approximating Hessians in unconstrained optimization arising from discretized problems, Optimization techniques for tree-structured nonlinear problems, A parallel computing scheme for minimizing a class of large scale functions, Optimization of unconstrained functions with sparse Hessian matrices—Quasi-Newton methods, On the generation of updates for quasi-Newton methods, A Sparse Quasi-Newton Update Derived Variationally with a Nondiagonally Weighted Frobenius Norm

Cites Work

• Least Change Secant Updates for Quasi-Newton Methods
• On Variable-Metric Methods for Sparse Hessians
• On the Superlinear Convergence of an Algorithm for Solving a Sparse Minimization Problem
• A note on quasi-newton formulae for sparse second derivative matrices
• Quasi-Newton Methods, Motivation and Theory
• On Sparse and Symmetric Matrix Updating Subject to a Linear Equation