Newton-Krylov type algorithm for solving nonlinear least squares problems

DOI10.1155/2009/435851zbMath1177.65084OpenAlexW2007706566WikidataQ58648445 ScholiaQ58648445MaRDI QIDQ1035156

Mohammedi R. Abdel-Aziz, Mahmoud M. El-Alem

Publication date: 10 November 2009

Published in: International Journal of Mathematics and Mathematical Sciences (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/45722

zbMATH Keywords

algorithmconvergencenonlinear least squares problemsNewton-Krylov subspace method

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Quadratic programming (90C20) Methods of quasi-Newton type (90C53)

Uses Software

• tn
• GQTPAR

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Convergence theory for the structured BFGS secant method with an application to nonlinear least squares
• A second-order method for unconstrained optimization
• Algorithms for Constrained and Weighted Nonlinear Least Squares
• Globally Convergent Algorithm for Solving Large Nonlinear Systems of Equations
• Computing a Trust Region Step
• Hybrid Krylov Methods for Nonlinear Systems of Equations
• A Family of Trust-Region-Based Algorithms for Unconstrained Minimization with Strong Global Convergence Properties
• Preconditioning of Truncated-Newton Methods
• Krylov Subspace Methods for Solving Large Unsymmetric Linear Systems
• Newton’s Method with a Model Trust Region Modification
• Some Special Nonlinear Least Squares Problems
• Separable nonlinear least squares: the variable projection method and its applications
• Stable factorized quasi-Newton methods for nonlinear least-squares problems