Tensor Methods for Large, Sparse Nonlinear Least Squares Problems

DOI10.1137/S1064827596297549zbMath0957.65065MaRDI QIDQ4509768

Ali Bouaricha, Robert B. Schnabel

Publication date: 19 October 2000

Published in: SIAM Journal on Scientific Computing (Search for Journal in Brave)

zbMATH Keywords

comparison of methodslarge-scale optimizationrank-deficient matricesGauss-Newton methodtensor methodssparse problems

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Large-scale problems in mathematical programming (90C06) Nonlinear programming (90C30)

Related Items (5)

A new subspace minimization conjugate gradient method based on tensor model for unconstrained optimization ⋮ Practical quasi-Newton algorithms for singular nonlinear systems ⋮ Convergence and evaluation-complexity analysis of a regularized tensor-Newton method for solving nonlinear least-squares problems ⋮ Modified Newton's method for systems of nonlinear equations with singular Jacobian ⋮ Tensor methods for large sparse systems of nonlinear equations

Uses Software

• TENSOLVE
• MINPACK-2

This page was built for publication: Tensor Methods for Large, Sparse Nonlinear Least Squares Problems