AbstractGiven the data (xi, yi), i=1, 2, …, n, the problem is to find the values of the linear and nonlinear parameters â and b̂ which minimize the nonlinear functional |F(b)a−y|22 over a ϵ Rp, b ϵ Rq, where F ϵ Rn×p is a variable matrix and assumed to be of full rank, and y ϵ Rn is a constant vector.In this paper, we present a method for solving this problem by imbedding it into a one-parameter family of problems and by following its solution path using a predictor-corrector algorithm. In the course of iterations, the original problem containing p+q+1 variables is transformed into a problem with q+1 nonlinear variables by taking the separable structure of the problem into account. By doing so, the method reduces to solving a series of equa...
A numerical algorithm for continuation of stationary solutions to nonlinear evolution problems repre...
We propose a new termination criterion suitable for potentially singular, zero or nonzero residual, ...
. For discrete nonlinear least-squares approximation problems P m j=1 f 2 j (x) ! min for m smo...
Consider the separable nonlinear least squares problem of finding ~a in R^n and ~alpha in R^k which,...
The nonlinear least squares problem m i n y , z ∥ A ( y ) z + b ( y ) ∥ , where ...
In this work, we combine the special structure of the separable nonlinear least squares problem with...
Abstract. We consider a class of non-linear least squares problems that are widely used in fitting e...
For separable nonlinear least squares models, a variable projection algorithm based on matrix factor...
We consider a class of non-linear least squares problems that are widely used in fitting experimenta...
In this paper, we consider methods for finding a local solution, $x^{*} $ say, to a nonlinear least ...
AbstractThis paper proposes an efficient continuation method for solving nonlinear equations. The pr...
AbstractSeparable least squares are generally written in the form ‖y−A(q)c ‖2 = min where minimizati...
Recently several algorithms have been proposed for solving separable nonlinear least squares problem...
AbstractWe develop successive overrelaxation (SOR) methods for finding the least squares solution of...
In this paper, we present a brief survey of methods for solving nonlinear least-squares problems. We...
A numerical algorithm for continuation of stationary solutions to nonlinear evolution problems repre...
We propose a new termination criterion suitable for potentially singular, zero or nonzero residual, ...
. For discrete nonlinear least-squares approximation problems P m j=1 f 2 j (x) ! min for m smo...
Consider the separable nonlinear least squares problem of finding ~a in R^n and ~alpha in R^k which,...
The nonlinear least squares problem m i n y , z ∥ A ( y ) z + b ( y ) ∥ , where ...
In this work, we combine the special structure of the separable nonlinear least squares problem with...
Abstract. We consider a class of non-linear least squares problems that are widely used in fitting e...
For separable nonlinear least squares models, a variable projection algorithm based on matrix factor...
We consider a class of non-linear least squares problems that are widely used in fitting experimenta...
In this paper, we consider methods for finding a local solution, $x^{*} $ say, to a nonlinear least ...
AbstractThis paper proposes an efficient continuation method for solving nonlinear equations. The pr...
AbstractSeparable least squares are generally written in the form ‖y−A(q)c ‖2 = min where minimizati...
Recently several algorithms have been proposed for solving separable nonlinear least squares problem...
AbstractWe develop successive overrelaxation (SOR) methods for finding the least squares solution of...
In this paper, we present a brief survey of methods for solving nonlinear least-squares problems. We...
A numerical algorithm for continuation of stationary solutions to nonlinear evolution problems repre...
We propose a new termination criterion suitable for potentially singular, zero or nonzero residual, ...
. For discrete nonlinear least-squares approximation problems P m j=1 f 2 j (x) ! min for m smo...