A continuation method for solving separable nonlinear least squares problems

DOI10.1016/0377-0427(84)90052-9zbMath0542.65033OpenAlexW2059768446MaRDI QIDQ795473

Nobuko Sagara, Masao Fukushima

Publication date: 1984

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

Full work available at URL: https://doi.org/10.1016/0377-0427(84)90052-9

zbMATH Keywords

global Newton homotopy continuation methodseparable nonlinear least squares problem

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A globally convergent algorithm for computing fixed points of \(C^2\) maps
• Solution Fields of Nonlinear Equations and Continuation Methods
• Simplicial and Continuation Methods for Approximating Fixed Points and Solutions to Systems of Equations
• Algorithms for Separable Nonlinear Least Squares Problems
• A variable projection method for solving separable nonlinear least squares problems
• A Constructive Proof of the Brouwer Fixed-Point Theorem and Computational Results
• Finding Zeroes of Maps: Homotopy Methods That are Constructive With Probability One
• The Differentiation of Pseudo-Inverses and Nonlinear Least Squares Problems Whose Variables Separate

This page was built for publication: A continuation method for solving separable nonlinear least squares problems