scientific article; zbMATH DE number 7523120

MaRDI QIDQ5074079

Tuyen Trung Truong, Hang-Tuan Nguyen

Publication date: 6 May 2022

Full work available at URL: https://www.heldermann.de/MTA/MTA07/MTA071/mta07003.htm

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

global convergencerandom dynamical systemsoptimisationbacktrackinggradient descentdeep learningline search method

Mathematics Subject Classification ID

Artificial intelligence (68Txx) Numerical methods in optimal control (49Mxx) Computing methodologies and applications (68Uxx) Numerical methods for mathematical programming, optimization and variational techniques (65Kxx)

Related Items (1)

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

Uses Software

• CIFAR
• GitHub
• MBT-optimizer

Cites Work

• Unnamed Item
• Unnamed Item
• Gradient methods of maximization
• Cauchy's method of minimization
• Introductory lectures on convex optimization. A basic course.
• Optimization and dynamical systems
• Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods
• Backtracking gradient descent method and some applications in large scale optimisation. II: Algorithms and experiments
• Minimization of functions having Lipschitz continuous first partial derivatives
• THE HEAVY BALL WITH FRICTION METHOD, I. THE CONTINUOUS DYNAMICAL SYSTEM: GLOBAL EXPLORATION OF THE LOCAL MINIMA OF A REAL-VALUED FUNCTION BY ASYMPTOTIC ANALYSIS OF A DISSIPATIVE DYNAMICAL SYSTEM
• Gradient Descent Only Converges to Minimizers: Non-Isolated Critical Points and Invariant Regions
• Optimization Methods for Large-Scale Machine Learning
• An Inertial Newton Algorithm for Deep Learning
• Analysis of the gradient method with an Armijo–Wolfe line search on a class of non-smooth convex functions
• The Boosted Difference of Convex Functions Algorithm for Nonsmooth Functions
• Convergence of the Iterates of Descent Methods for Analytic Cost Functions
• Convergence Conditions for Ascent Methods
• Limit Points of Sequences in Metric Spaces
• A Stochastic Approximation Method
• The method of steepest descent for non-linear minimization problems
• Optimization

This page was built for publication: