Convergence analysis of a proximal Gauss-Newton method
From MaRDI portal
Abstract: An extension of the Gauss-Newton algorithm is proposed to find local minimizers of penalized nonlinear least squares problems, under generalized Lipschitz assumptions. Convergence results of local type are obtained, as well as an estimate of the radius of the convergence ball. Some applications for solving constrained nonlinear equations are discussed and the numerical performance of the method is assessed on some significant test problems.
Recommendations
- Local convergence analysis of proximal Gauss-Newton method for penalized nonlinear least squares problems
- Local convergence analysis of the Gauss-Newton method under a majorant condition
- On the local convergence of the Gauss-Newton method
- The convergence analysis of inexact Gauss-Newton methods for nonlinear problems
- Convergence analysis of the general Gauss-Newton algorithm
Cites work
- A collection of test problems for constrained global optimization algorithms
- A convergence analysis of the iteratively regularized Gauss–Newton method under the Lipschitz condition
- A Gauss-Newton method for convex composite optimization
- A Kantorovich-type convergence analysis for the Gauss-Newton-method
- A modified Newton-Raphson method for the solution of systems of equations
- A Tikhonov-based projection iteration for nonlinear ill-posed problems with sparsity con\-straints
- An active set-type Newton method for constrained nonlinear systems
- An algorithm for composite nonsmooth optimization problems
- Convergence and uniqueness properties of Gauss-Newton's method
- Convergence behavior of Gauss-Newton's method and extensions of the Smale point estimate theory
- Convergence criterion of Newton's method for singular systems with constant rank derivatives
- Convergence of Newton’s method and inverse function theorem in Banach space
- Convergence of Newton's method and uniqueness of the solution of equations in Banach space
- Convergence of Newton's method and uniqueness of the solution of equations in Banach spaces. II
- Convergence rates for the iteratively regularized Gauss-Newton method in Banach spaces
- Extending the applicability of the Gauss-Newton method under average Lipschitz-type conditions
- scientific article; zbMATH DE number 3476911 (Why is no real title available?)
- scientific article; zbMATH DE number 3558452 (Why is no real title available?)
- scientific article; zbMATH DE number 1243473 (Why is no real title available?)
- scientific article; zbMATH DE number 2146003 (Why is no real title available?)
- scientific article; zbMATH DE number 936298 (Why is no real title available?)
- scientific article; zbMATH DE number 2214457 (Why is no real title available?)
- scientific article; zbMATH DE number 3187170 (Why is no real title available?)
- scientific article; zbMATH DE number 3192366 (Why is no real title available?)
- Investigation of preconditioning techniques for the iteratively regularized Gauss-Newton method for exponentially ill-posed problems
- Iterative total variation schemes for nonlinear inverse problems
- Kantorovich's majorants principle for Newton's method
- Local properties of algorithms for minimizing nonsmooth composite functions
- Majorizing Functions and Convergence of the Gauss–Newton Method for Convex Composite Optimization
- Nonmonotone trust-region methods for bound-constrained semismooth equations with applications to nonlinear mixed complementarity problems
- On convergence of the Gauss-Newton method for convex composite optimization.
- On convergence rates for the iteratively regularized Gauss-newton method
- On the Continuity of the Generalized Inverse
- On the local convergence of the Gauss-Newton method
- On the semilocal convergence of a Newton-type method of order three
- Perturbation theory for pseudo-inverses
- Proximité et dualité dans un espace hilbertien
- Signal Recovery by Proximal Forward-Backward Splitting
- Solving nonlinear systems of equations with simple constraints
- STRSCNE: a scaled trust-region solver for constrained nonlinear equations
- Tikhonov replacement functionals for iteratively solving nonlinear operator equations
- Variational methods in imaging
Cited in
(15)- Convergence analysis of Gauss-Newton methods for the complementarity problem
- The multiproximal linearization method for convex composite problems
- A proximal regularized Gauss-Newton-Kaczmarz method and its acceleration for nonlinear ill-posed problems
- Gauss-Newton methods with approximate projections for solving constrained nonlinear least squares problems
- A proximal iteratively regularized Gauss-Newton method for nonlinear inverse problems
- The convergence analysis of inexact Gauss-Newton methods for nonlinear problems
- Local convergence analysis of proximal Gauss-Newton method for penalized nonlinear least squares problems
- Graph-convergent analysis of over-relaxed \((A, \eta, m)\)-proximal point iterative methods with errors for general nonlinear operator equations
- Local analysis of a spectral correction for the Gauss-Newton model applied to quadratic residual problems
- Asymptotic Convergence Analysis of a New Class of Proximal Point Methods
- Proximal Gradient Methods for Machine Learning and Imaging
- Contact adapting electrode model for electrical impedance tomography
- Relaxed Gauss-Newton methods with applications to electrical impedance tomography
- Deep-plug-and-play proximal Gauss-Newton method with applications to nonlinear, ill-posed inverse problems
- Convergence analysis of the general Gauss-Newton algorithm
This page was built for publication: Convergence analysis of a proximal Gauss-Newton method
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1928745)
