Nonsmooth nonconvex stochastic heavy ball
From MaRDI portal
Publication:6536841
DOI10.1007/S10957-024-02408-3MaRDI QIDQ6536841FDOQ6536841
Authors: Tam Le 
Publication date: 14 May 2024
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Online algorithms; streaming algorithms (68W27) Analysis of algorithms and problem complexity (68Q25) Nonsmooth analysis (49J52) Set-valued set functions and measures; integration of set-valued functions; measurable selections (28B20)
Cites Work
- Title not available (Why is that?)
- Geometric categories and o-minimal structures
- Title not available (Why is that?)
- Stochastic generalized gradient method for nonconvex nonsmooth stochastic optimization
- Topological aspects of nonsmooth optimization.
- Stochastic Approximations and Differential Inclusions
- Some methods of speeding up the convergence of iteration methods
- Title not available (Why is that?)
- Stability under integration of sums of products of real globally subanalytic functions and their logarithms
- Stochastic generalized-differentiable functions in the problem of nonconvex nonsmooth stochastic optimization
- Stochastic heavy ball
- Stochastic subgradient method converges on tame functions
- Conservative set valued fields, automatic differentiation, stochastic gradient methods and deep learning
- Convergence of constant step stochastic gradient descent for non-smooth non-convex functions
- An inertial Newton algorithm for deep learning
- Convergence of a stochastic subgradient method with averaging for nonsmooth nonconvex constrained optimization
- Long term dynamics of the subgradient method for Lipschitz path differentiable functions
This page was built for publication: Nonsmooth nonconvex stochastic heavy ball
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6536841)
