DeepAI AI Chat
Log In Sign Up

A doubly relaxed minimal-norm Gauss-Newton method for nonlinear least-squares

by   Federica Pes, et al.

When a physical system is modeled by a nonlinear function, the unknown parameters can be estimated by fitting experimental observations by a least-squares approach. Newton's method and its variants are often used to solve problems of this type. In this paper, we are concerned with the computation of the minimal-norm solution to an underdetermined nonlinear least-squares problem. We present a Gauss-Newton type method, which relies on two relaxation parameters to ensure convergence, and which incorporates a procedure to dynamically estimate the two parameters during iteration, as well as the rank of the Jacobian matrix. Numerical results are presented.


page 1

page 2

page 3

page 4


A Randomised Subspace Gauss-Newton Method for Nonlinear Least-Squares

We propose a Randomised Subspace Gauss-Newton (R-SGN) algorithm for solv...

Efficient Inversion of Matrix φ-Functions of Low Order

The paper is concerned with efficient numerical methods for solving a li...

The Carleman-Newton method to globally reconstruct a source term for nonlinear parabolic equation

We propose to combine the Carleman estimate and the Newton method to sol...

A Global Newton-Type Scheme Based on a Simplified Newton-Type Approach

Globalization concepts for Newton-type iteration schemes are widely used...

Accelerating the Distributed Kaczmarz Algorithm by Strong Over-relaxation

The distributed Kaczmarz algorithm is an adaptation of the standard Kacz...

The projected Newton-Kleinman method for the algebraic Riccati equation

The numerical solution of the algebraic Riccati equation is a challengin...