A fast and simple modification of Newton's method avoiding saddle points

DOI10.1007/S10957-023-02270-9MaRDI QIDQ6086150zbMATH OpenOpenAlexFDO

Authors Tuyen Trung Truong, Tat Dat Tô, Hang-Tuan Nguyen, Thu Hang Nguyen, Hoang Phuong Nguyen, Maged Helmy

Publication date 9 November 2023

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

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/s10957-023-02270-9

zbMATH Keywords

backtracking line searchNewton-type methodrate of convergenceroots of univariate meromorphic functionssaddle points

Mathematics Subject Classification ID

Dynamical systems in optimization and economics (37N40) Newton-type methods (49M15) Numerical methods based on nonlinear programming (49M37) Numerical mathematical programming methods (65K05) Nonconvex programming, global optimization (90C26)

Recommendations

• Inertial Newton algorithms avoiding strict saddle points
• scientific article; zbMATH DE number 4037055
• Quasi-Newton methods for saddlepoints
• A Newton-based method for nonconvex optimization with fast evasion of saddle points
• Convergence Rates for Newton’s Method at Singular Points

Cites work

• A cubic regularization algorithm for unconstrained optimization using line search and nonmonotone techniques
• A Machine Method for Solving Polynomial Equations
• A method for the solution of certain non-linear problems in least squares
• A Numerical Method for Locating the Zeros of an Analytic Function
• A regularized Newton method for degenerate unconstrained optimization problems
• A regularized Newton method without line search for unconstrained optimization
• A stabilized SQP method: global convergence
• A stabilized SQP method: superlinear convergence
• Adaptive cubic regularisation methods for unconstrained optimization. I: Motivation, convergence and numerical results
• An Algorithm for Least-Squares Estimation of Nonlinear Parameters
• An inertial Newton algorithm for deep learning
• Backtracking gradient descent method and some applications in large scale optimisation. II: Algorithms and experiments
• Convergence of the Iterates of Descent Methods for Analytic Cost Functions
• Convergence properties of the regularized Newton method for the unconstrained nonconvex optimization
• Cubic regularization of Newton method and its global performance
• Finding zeros of Hölder metrically subregular mappings via globally convergent Levenberg-Marquardt methods
• scientific article; zbMATH DE number 1694914 (Why is no real title available?)
• scientific article; zbMATH DE number 3980052 (Why is no real title available?)
• scientific article; zbMATH DE number 7523120 (Why is no real title available?)
• Local convergence of the Levenberg-Marquardt method under Hölder metric subregularity
• Mathematical problems for the next century
• Minimization of functions having Lipschitz continuous first partial derivatives
• Negativity of Lyapunov exponents and convergence of generic random polynomial dynamical systems and random relaxed Newton's methods
• On the quadratic convergence of the Levenberg-Marquardt method without nonsingularity assumption
• Perturbation theory for linear operators.

Cited in

(4)

• Inertial Newton algorithms avoiding strict saddle points
• Backtracking new Q-Newton's method, Newton's flow, Voronoi's diagram and stochastic root finding
• Estimating associations between cumulative exposure and health via generalized distributed lag non-linear models using penalized splines
• Schröder's theorem for backtracking new Q-Newton's method

This page was built for publication: A fast and simple modification of Newton's method avoiding saddle points

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6086150)