General inertial proximal stochastic mirror descent algorithm beyond Lipschitz smoothness assumption
From MaRDI portal
Cites work
- A descent lemma beyond Lipschitz gradient continuity: first-order methods revisited and applications
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- A Modified Forward-Backward Splitting Method for Maximal Monotone Mappings
- A new hybrid generalized proximal point algorithm for variational inequality problems
- A proximal stochastic gradient method with progressive variance reduction
- A simplified view of first order methods for optimization
- A Stochastic Proximal Alternating Minimization for Nonsmooth and Nonconvex Optimization
- Accelerated gradient methods for nonconvex nonlinear and stochastic programming
- An alternating structure-adapted Bregman proximal gradient descent algorithm for constrained nonconvex nonsmooth optimization problems and its inertial variant
- An interior point method with Bregman functions for the variational inequality problem with paramonotone operators
- Calculus of the exponent of Kurdyka-Łojasiewicz inequality and its applications to linear convergence of first-order methods
- Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods
- Convex analysis and monotone operator theory in Hilbert spaces
- First order methods beyond convexity and Lipschitz gradient continuity with applications to quadratic inverse problems
- General inertial proximal gradient method for a class of nonconvex nonsmooth optimization problems
- Gradient methods for minimizing composite functions
- scientific article; zbMATH DE number 3296905 (Why is no real title available?)
- Incremental proximal methods for large scale convex optimization
- Introductory lectures on convex optimization. A basic course.
- Linear convergence of proximal gradient algorithm with extrapolation for a class of nonconvex nonsmooth minimization problems
- Mirror descent and nonlinear projected subgradient methods for convex optimization.
- Proximal alternating linearized minimization for nonconvex and nonsmooth problems
- Proximal Alternating Minimization and Projection Methods for Nonconvex Problems: An Approach Based on the Kurdyka-Łojasiewicz Inequality
- Some methods of speeding up the convergence of iteration methods
- The ordered subsets mirror descent optimization method with applications to tomography
- Why least squares and maximum entropy? An axiomatic approach to inference for linear inverse problems
This page was built for publication: General inertial proximal stochastic mirror descent algorithm beyond Lipschitz smoothness assumption
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6894151)
