Subspace methods for large scale nonlinear equations and nonlinear least squares
DOI10.1007/s11081-008-9064-0zbMath1171.65040OpenAlexW2030840351MaRDI QIDQ833458
Publication date: 12 August 2009
Published in: Optimization and Engineering (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11081-008-9064-0
subspace methodsconjugate gradient methodtrust region methodprojected gradient methodquasi-Newton methodline searchnonlinear least squaresnull space methodsystems nonlinear of equations
Numerical mathematical programming methods (65K05) Quadratic programming (90C20) Numerical computation of solutions to systems of equations (65H10) Methods of quasi-Newton type (90C53) Interior-point methods (90C51)
Related Items (34)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the limited memory BFGS method for large scale optimization
- Impact of partial separability on large-scale optimization
- On the truncated conjugate gradient method
- A subspace implementation of quasi-Newton trust region methods for unconstrained optimization
- Reduced-Hessian Quasi-Newton Methods for Unconstrained Optimization
- Numerical methods for large-scale nonlinear optimization
- The Conjugate Gradient Method and Trust Regions in Large Scale Optimization
- Numerical Optimization
- On Large Scale Nonlinear Least Squares Calculations
- A Subspace Study on Conjugate Gradient Algorithms
This page was built for publication: Subspace methods for large scale nonlinear equations and nonlinear least squares