A subgradient method with constant step-size for _1-composite optimization
From MaRDI portal
(Redirected from Publication:6564822)
A subgradient method with constant step-size for \(\ell 1\)-composite optimization
A subgradient method with constant step-size for \(\ell 1\)-composite optimization
Recommendations
- A subgradient method with non-monotone line search
- New results on subgradient methods for strongly convex optimization problems with a unified analysis
- Faster subgradient methods for functions with Hölderian growth
- Primal subgradient methods with predefined step sizes
- Subgradient methods for sharp weakly convex functions
Cites work
- A block coordinate descent method for regularized multiconvex optimization with applications to nonnegative tensor factorization and completion
- A differential equation for modeling Nesterov's accelerated gradient method: theory and insights
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- A piecewise conservative method for unconstrained convex optimization
- A survey of \(L_1\) regression
- Adaptive restart for accelerated gradient schemes
- Convex optimization algorithms
- Fast convergence of inertial dynamics and algorithms with asymptotic vanishing viscosity
- Fast convex optimization via inertial dynamics with Hessian driven damping
- Faster subgradient methods for functions with Hölderian growth
- From error bounds to the complexity of first-order descent methods for convex functions
- Geometric Numerical Integration
- Gradient methods for minimizing composite functions
- scientific article; zbMATH DE number 3850830 (Why is no real title available?)
- scientific article; zbMATH DE number 1266748 (Why is no real title available?)
- Image Super-Resolution Via Sparse Representation
- Lectures on convex optimization
- Lyapunov stability of the subgradient method with constant step size
- Nondifferentiable optimization and polynomial problems
- Scaled, inexact, and adaptive generalized FISTA for strongly convex optimization
- Signal Recovery by Proximal Forward-Backward Splitting
- Some methods of speeding up the convergence of iteration methods
- Stable signal recovery from incomplete and inaccurate measurements
- Subgradient methods for sharp weakly convex functions
This page was built for publication: A subgradient method with constant step-size for \(\ell_1\)-composite optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6564822)
