An accelerated coordinate gradient descent algorithm for non-separable composite optimization
From MaRDI portal
Publication:2139254
DOI10.1007/s10957-021-01957-1zbMath1492.90119OpenAlexW3217620259MaRDI QIDQ2139254
Publication date: 17 May 2022
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10957-021-01957-1
Related Items
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- Gradient methods for minimizing composite functions
- Iteration complexity analysis of block coordinate descent methods
- An \(O(n)\) algorithm for projecting a vector on the intersection of a hyperplane and a box in \(\mathbb R^n\)
- Envelope functions: unifications and further properties
- Coordinate descent algorithms
- Forward-backward quasi-Newton methods for nonsmooth optimization problems
- Pathwise coordinate optimization
- Efficiency of Coordinate Descent Methods on Huge-Scale Optimization Problems
- Smoothing and First Order Methods: A Unified Framework
- Total Variation on a Tree
- Accelerated, Parallel, and Proximal Coordinate Descent
- The Cyclic Block Conditional Gradient Method for Convex Optimization Problems
- First-Order Methods in Optimization
- Modular proximal optimization for multidimensional total-variation regularization
- A Coordinate-Descent Primal-Dual Algorithm with Large Step Size and Possibly Nonseparable Functions
- An iterative thresholding algorithm for linear inverse problems with a sparsity constraint
- On the Convergence of Block Coordinate Descent Type Methods
- Interior Gradient and Proximal Methods for Convex and Conic Optimization
- Stochastic Quasi-Fejér Block-Coordinate Fixed Point Iterations with Random Sweeping
- Proximité et dualité dans un espace hilbertien
