An inexact gradient mirror descent algorithm for non-smooth convex optimization
From MaRDI portal
Recommendations
- Gradient-free proximal methods with inexact oracle for convex stochastic nonsmooth optimization problems on the simplex
- Mirror descent and convex optimization problems with non-smooth inequality constraints
- An inexact proximal gradient algorithm with extrapolation for a class of nonconvex nonsmooth optimization problems
- Stochastic incremental mirror descent algorithms with Nesterov smoothing
- scientific article; zbMATH DE number 7404502
Cites work
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- A multilevel proximal gradient algorithm for a class of composite optimization problems
- A Singular Value Thresholding Algorithm for Matrix Completion
- Accelerated and inexact forward-backward algorithms
- An inexact accelerated proximal gradient method for large scale linearly constrained convex SDP
- Block-coordinate gradient descent method for linearly constrained nonsmooth separable optimization
- Fixed point and Bregman iterative methods for matrix rank minimization
- scientific article; zbMATH DE number 1807400 (Why is no real title available?)
- Inertial variable metric techniques for the inexact forward-backward algorithm
- Inexact and accelerated proximal point algorithms
- Introductory lectures on convex optimization. A basic course.
- MAGMA: multilevel accelerated gradient mirror descent algorithm for large-scale convex composite minimization
- On the Nonasymptotic Convergence of Cyclic Coordinate Descent Methods
- The Variable Metric Forward-Backward Splitting Algorithm Under Mild Differentiability Assumptions
- Total Variation Projection With First Order Schemes
This page was built for publication: An inexact gradient mirror descent algorithm for non-smooth convex optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6188352)
