Solving the nonlinear least square problem: Application of a general method

From MaRDI portal
Revision as of 06:42, 31 January 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:1216860

DOI10.1007/BF00932656zbMath0304.49024MaRDI QIDQ1216860

John T. Betts

Publication date: 1976

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)




Related Items (16)

Numerical experiments with variations of the Gauss-Newton algorithm for nonlinear least squaresConvergence theory for the structured BFGS secant method with an application to nonlinear least squaresHybrid methods for large sparse nonlinear least squaresStructured two-point stepsize gradient methods for nonlinear least squaresStructured adaptive spectral-based algorithms for nonlinear least squares problems with robotic arm modelling applicationsA structured diagonal Hessian approximation method with evaluation complexity analysis for nonlinear least squaresSuperlinearly convergent exact penalty methods with projected structured secant updates for constrained nonlinear least squaresFactorized quasi-Newton methods for nonlinear least squares problemsNumerical algorithms for solving nonlinearLр-norm estimation problems: part II - a mixture method for large residual and illo-conditioned problemsNumerical experiments with the one-dimensional non-linear simplex searchA brief survey of methods for solving nonlinear least-squares problemsA gradient projection-multiplier method for nonlinear programmingTechniques for nonlinear least squares and robust regressionA two-step superlinearly convergent projected structured BFGS method for constrained nonlinear least squaresOn a modification of Marquardt's compromise: Rationale and applicationsVariable metric methods for unconstrained optimization and nonlinear least squares




Cites Work




This page was built for publication: Solving the nonlinear least square problem: Application of a general method