Avoiding Modified Matrix Factorizations in Newton-like Methods

DOI10.1080/02522667.1988.10698917MaRDI QIDQ3802526zbMATH OpenOpenAlexWikidataFDO

Authors 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 examplesNewton methodunconstrained minimizationavoidance of modified matrix factorizations

Mathematics Subject Classification ID

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

Cites work

• scientific article; zbMATH DE number 3473182 (Why is no real title available?)
• scientific article; zbMATH DE number 3381785 (Why is no real title available?)
• A discrete Newton algorithm for minimizing a function of many variables
• Methods of conjugate gradients for solving linear systems
• Newton-Type Minimization via the Lanczos Method
• Newton-type methods for unconstrained and linearly constrained optimization
• Numerically stable methods for quadratic programming
• On the use of directions of negative curvature in a modified newton method
• Preconditioning of Truncated-Newton Methods
• Solution of Sparse Indefinite Systems of Linear Equations
• Testing Unconstrained Optimization Software
• Truncated-Newton algorithms for large-scale unconstrained optimization

Describes a project that uses

Uses Software

• tn

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3802526)