Modified Gauss–Newton scheme with worst case guarantees for global performance
From MaRDI portal
Publication:5436914
DOI10.1080/08927020600643812zbMath1136.65051OpenAlexW2983918189MaRDI QIDQ5436914
No author found.
Publication date: 18 January 2008
Published in: Optimization Methods and Software (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/08927020600643812
convex optimizationsystems of nonlinear equationsGauss-Newton methodlocal quadratic convergencetrust-region methodsglobal rate of convergencequadratic regularizationworst-case complexity bounds
Numerical mathematical programming methods (65K05) Nonconvex programming, global optimization (90C26) Numerical computation of solutions to systems of equations (65H10) Interior-point methods (90C51) Complexity and performance of numerical algorithms (65Y20)
Related Items
An improvement of adaptive cubic regularization method for unconstrained optimization problems ⋮ A new adaptive trust-region method for system of nonlinear equations ⋮ Smoothing projected Barzilai-Borwein method for constrained non-Lipschitz optimization ⋮ Proximal methods avoid active strict saddles of weakly convex functions ⋮ Local analysis of a spectral correction for the Gauss-Newton model applied to quadratic residual problems ⋮ Global convergence of model function based Bregman proximal minimization algorithms ⋮ Global complexity bound of the inexact Levenberg-Marquardt method ⋮ Complexity of the Newton method for set-valued maps ⋮ A Proximal Quasi-Newton Trust-Region Method for Nonsmooth Regularized Optimization ⋮ Sparse solutions of optimal control via Newton method for under-determined systems ⋮ A first-order primal-dual algorithm for convex problems with applications to imaging ⋮ On a global complexity bound of the Levenberg-marquardt method ⋮ Newton-MR: inexact Newton method with minimum residual sub-problem solver ⋮ Regularized Newton Method with Global \({\boldsymbol{\mathcal{O}(1/{k}^2)}}\) Convergence ⋮ On the complexity of a stochastic Levenberg-Marquardt method ⋮ Majorization-minimization-based Levenberg-Marquardt method for constrained nonlinear least squares ⋮ Relax-and-split method for nonconvex inverse problems ⋮ A structured diagonal Hessian approximation method with evaluation complexity analysis for nonlinear least squares ⋮ Some modifications of Newton's method for solving systems of equations ⋮ Nonsmooth optimization using Taylor-like models: error bounds, convergence, and termination criteria ⋮ On the convergence and worst-case complexity of trust-region and regularization methods for unconstrained optimization ⋮ A note on the smoothing quadratic regularization method for non-Lipschitz optimization ⋮ Nonlinear stepsize control algorithms: complexity bounds for first- and second-order optimality ⋮ Worst-case evaluation complexity for unconstrained nonlinear optimization using high-order regularized models ⋮ Nonlinear stepsize control, trust regions and regularizations for unconstrained optimization ⋮ A brief survey of methods for solving nonlinear least-squares problems ⋮ Minimizing uniformly convex functions by cubic regularization of Newton method ⋮ On the use of iterative methods in cubic regularization for unconstrained optimization ⋮ Trust-region and other regularisations of linear least-squares problems ⋮ On the worst-case complexity of nonlinear stepsize control algorithms for convex unconstrained optimization ⋮ Global complexity bound of the Levenberg–Marquardt method ⋮ Efficiency of minimizing compositions of convex functions and smooth maps ⋮ Stochastic variance-reduced prox-linear algorithms for nonconvex composite optimization ⋮ New versions of Newton method: step-size choice, convergence domain and under-determined equations ⋮ Unnamed Item ⋮ Stochastic Gauss-Newton algorithm with STORM estimators for nonconvex composite optimization ⋮ High-Order Optimization Methods for Fully Composite Problems ⋮ Adaptive Gauss-Newton method for solving systems of nonlinear equations
Cites Work
