Specialised versus general-purpose algorithms for minimising functions that are sums of squared terms
From MaRDI portal
Publication:4076765
Cites work
- scientific article; zbMATH DE number 3357824 (Why is no real title available?)
- scientific article; zbMATH DE number 3405688 (Why is no real title available?)
- scientific article; zbMATH DE number 3421857 (Why is no real title available?)
- A Comparison of Several Current Optimization Methods, and the use of Transformations in Constrained Problems
- A Method for Minimizing a Sum of Squares of Non-Linear Functions Without Calculating Derivatives
- Comparison of Gradient Methods for the Solution of Nonlinear Parameter Estimation Problems
- Computational experience with quadratically convergent minimisation methods
Cited in
(12)- Statistical methods in surveying by trilateration.
- Factorized quasi-Newton methods for nonlinear least squares problems
- The estimation of the hessian matrix in nonlinear least squares problems with non-zero residuals
- Least squares with non-linear equality constraints. Application to closing of balances
- Local analysis of a spectral correction for the Gauss-Newton model applied to quadratic residual problems
- A review of the parameter estimation problem of fitting positive exponential sums to empirical data
- A brief survey of methods for solving nonlinear least-squares problems
- Structured two-point stepsize gradient methods for nonlinear least squares
- PROFILING NEURAL NETWORKS FOR OPTION PRICING
- A comparison of some algorithms for the nonlinear least squares problem
- A two-dimensional search used with a nonlinear least-squares solver
- A structured diagonal Hessian approximation method with evaluation complexity analysis for nonlinear least squares
This page was built for publication: Specialised versus general-purpose algorithms for minimising functions that are sums of squared terms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4076765)
