Avoiding Modified Matrix Factorizations in Newton-like Methods

DOI10.1080/02522667.1988.10698917zbMath0655.65091OpenAlexW2054338004WikidataQ114100879 ScholiaQ114100879MaRDI QIDQ3802526

Stephen G. Nash

Publication date: 1988

Published in: Journal of Information and Optimization Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/02522667.1988.10698917

zbMATH Keywords

numerical examplesunconstrained minimizationNewton methodavoidance of modified matrix factorizations

Mathematics Subject Classification ID

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

Uses Software

• tn

Cites Work

• Unnamed Item
• Unnamed Item
• Truncated-Newton algorithms for large-scale unconstrained optimization
• Newton-Type Minimization via the Lanczos Method
• Preconditioning of Truncated-Newton Methods
• Testing Unconstrained Optimization Software
• A discrete Newton algorithm for minimizing a function of many variables
• Newton-type methods for unconstrained and linearly constrained optimization
• Solution of Sparse Indefinite Systems of Linear Equations
• Numerically stable methods for quadratic programming
• On the use of directions of negative curvature in a modified newton method
• Methods of conjugate gradients for solving linear systems

This page was built for publication: Avoiding Modified Matrix Factorizations in Newton-like Methods