On the non-singularity of the quasi-Newton-least squares method

DOI10.1016/j.cam.2013.08.020zbMath1294.65057OpenAlexW2041907307MaRDI QIDQ2252235

Yanyan Li

Publication date: 16 July 2014

Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cam.2013.08.020

zbMATH Keywords

iterative methodleast squaressecant methodgeneralized minimal residual methodquasi-Newton methodrank-one updatenon-singularityaffine problem

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Numerical computation of solutions to systems of equations (65H10) Methods of quasi-Newton type (90C53)

Related Items (2)

Equivalence of QN-LS and BQN-LS for affine problems ⋮ On the similarities between the quasi-Newton least squares method and GMRes

Uses Software

• MINRES

Cites Work

• On the Similarities Between the Quasi-Newton Inverse Least Squares Method and GMRes
• Implicit Coupling of Partitioned Fluid-Structure Interaction Solvers using Reduced-Order Models
• The Quasi-Newton Least Squares Method: A New and Fast Secant Method Analyzed for Linear Systems

This page was built for publication: On the non-singularity of the quasi-Newton-least squares method