Extensions of CGS algorithms: Generalized least-square solutions
From MaRDI portal
Publication:1235497
DOI10.1007/BF00932885zbMath0351.65018OpenAlexW2034271631MaRDI QIDQ1235497
Publication date: 1978
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf00932885
Numerical solutions to overdetermined systems, pseudoinverses (65F20) Numerical mathematical programming methods (65K05) Nonlinear programming (90C30)
Related Items (1)
Cites Work
- CGS algorithms for unconstrained minimization of functions
- Study on a supermemory gradient method for the minimization of functions
- Pseudoinversus and conjugate gradients
- A Rapidly Convergent Descent Method for Minimization
- A Comparison of Several Current Optimization Methods, and the use of Transformations in Constrained Problems
- Comparison of Gradient Methods for the Solution of Nonlinear Parameter Estimation Problems
- Methods of conjugate gradients for solving linear systems
This page was built for publication: Extensions of CGS algorithms: Generalized least-square solutions
