Stochastic Bregman subgradient methods for nonsmooth nonconvex optimization problems
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 3790208 (Why is no real title available?)
- scientific article; zbMATH DE number 46303 (Why is no real title available?)
- scientific article; zbMATH DE number 1266748 (Why is no real title available?)
- scientific article; zbMATH DE number 1022519 (Why is no real title available?)
- scientific article; zbMATH DE number 3238721 (Why is no real title available?)
- scientific article; zbMATH DE number 3296905 (Why is no real title available?)
- A Stochastic Subgradient Method for Nonsmooth Nonconvex Multilevel Composition Optimization
- A descent lemma beyond Lipschitz gradient continuity: first-order methods revisited and applications
- A stochastic subgradient method for distributionally robust non-convex and non-smooth learning
- An efficient implementable inexact entropic proximal point algorithm for a class of linear programming problems
- An inertial Newton algorithm for deep learning
- Approximate Bregman proximal gradient algorithm for relatively smooth nonconvex optimization
- Barrier Operators and Associated Gradient-Like Dynamical Systems for Constrained Minimization Problems
- Bregman proximal point algorithm revisited: a new inexact version and its inertial variant
- Clarke Subgradients of Stratifiable Functions
- Conservative set valued fields, automatic differentiation, stochastic gradient methods and deep learning
- Convergence of a stochastic subgradient method with averaging for nonsmooth nonconvex constrained optimization
- Fastest rates for stochastic mirror descent methods
- First order methods beyond convexity and Lipschitz gradient continuity with applications to quadratic inverse problems
- Geometric categories and o-minimal structures
- Hessian Riemannian Gradient Flows in Convex Programming
- Iterative Bregman projections for regularized transportation problems
- Mirror descent and nonlinear projected subgradient methods for convex optimization.
- Nonconvex stochastic Bregman proximal gradient method with application to deep learning
- Nonsmooth nonconvex stochastic heavy ball
- Policy Mirror Descent for Regularized Reinforcement Learning: A Generalized Framework with Linear Convergence
- Policy mirror descent for reinforcement learning: linear convergence, new sampling complexity, and generalized problem classes
- Relatively smooth convex optimization by first-order methods, and applications
- Some methods of speeding up the convergence of iteration methods
- Stochastic Approximations and Differential Inclusions
- Stochastic Methods for Composite and Weakly Convex Optimization Problems
- Stochastic subgradient method converges on tame functions
- Subgradient Sampling for Nonsmooth Nonconvex Minimization
- Variational Analysis
This page was built for publication: Stochastic Bregman subgradient methods for nonsmooth nonconvex optimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6952221)
