The approximate greatest descent (AGD) method and a two-phase AGD method (AGDN) are proposed as new methods for a nonlinear least squares problem. Numerical experiments show that these methods outperform existing methods including the Levenberg-Marquardt method. However, the AGDN method outperforms the AGD method with a faster convergence. If the AGDN method fails due to singularity of the Hessian matrix, the AGD method should be used
We propose a modification of an algorithm introduced by Martínez (1987) for solving nonlinear least-...
This thesis introduces a globalization strategy for approximating global minima of zero-residual lea...
When minimizing a nonlinear least-squares function, the Levenberg-Marquardt algorithm can suffer fro...
The conditional, unconditional, or the exact maximum likelihood estimation and the least-squares est...
In this paper, we present a brief survey of methods for solving nonlinear least-squares problems. We...
This paper presents modifications of the Levenberg-Marquardt method for solving nonlinear least squa...
SIGLEAvailable from British Library Document Supply Centre- DSC:D188226 / BLDSC - British Library Do...
This thesis presents a class of methods for solving nonlinear least squares problems. A comprehensiv...
A new numerical method for the least square solutions of nonlinear equation systems has b...
The rapid development of artificial intelligence and computational sciences has attracted much more ...
Abstract. The least mean squares (LMS) method for linear least squares problems differs from the ste...
An optimization problem that does not have an unique local minimum is often very difficult to solve....
2009-2010 > Academic research: refereed > Publication in refereed journalVersion of RecordPublishe
The purpose of this thesis is to examine different methods of curve-fitting through the process of n...
This contribution contains a description and analysis of effective methods for minimization of the n...
We propose a modification of an algorithm introduced by Martínez (1987) for solving nonlinear least-...
This thesis introduces a globalization strategy for approximating global minima of zero-residual lea...
When minimizing a nonlinear least-squares function, the Levenberg-Marquardt algorithm can suffer fro...
The conditional, unconditional, or the exact maximum likelihood estimation and the least-squares est...
In this paper, we present a brief survey of methods for solving nonlinear least-squares problems. We...
This paper presents modifications of the Levenberg-Marquardt method for solving nonlinear least squa...
SIGLEAvailable from British Library Document Supply Centre- DSC:D188226 / BLDSC - British Library Do...
This thesis presents a class of methods for solving nonlinear least squares problems. A comprehensiv...
A new numerical method for the least square solutions of nonlinear equation systems has b...
The rapid development of artificial intelligence and computational sciences has attracted much more ...
Abstract. The least mean squares (LMS) method for linear least squares problems differs from the ste...
An optimization problem that does not have an unique local minimum is often very difficult to solve....
2009-2010 > Academic research: refereed > Publication in refereed journalVersion of RecordPublishe
The purpose of this thesis is to examine different methods of curve-fitting through the process of n...
This contribution contains a description and analysis of effective methods for minimization of the n...
We propose a modification of an algorithm introduced by Martínez (1987) for solving nonlinear least-...
This thesis introduces a globalization strategy for approximating global minima of zero-residual lea...
When minimizing a nonlinear least-squares function, the Levenberg-Marquardt algorithm can suffer fro...