Easily Parallelizable and Distributable Class of Algorithms for Structured Sparsity, with Optimal Acceleration
From MaRDI portal
(Redirected from Publication:3391206)
Cites work
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- A first-order primal-dual algorithm for convex problems with applications to imaging
- A general framework for a class of first order primal-dual algorithms for convex optimization in imaging science
- A primal-dual fixed point algorithm for minimization of the sum of three convex separable functions
- A primal-dual splitting method for convex optimization involving Lipschitzian, proximable and linear composite terms
- A primal–dual fixed point algorithm for convex separable minimization with applications to image restoration
- A simple algorithm for a class of nonsmooth convex-concave saddle-point problems
- A splitting algorithm for dual monotone inclusions involving cocoercive operators
- An inertial forward-backward-forward primal-dual splitting algorithm for solving monotone inclusion problems
- Complexity of Variants of Tseng's Modified F-B Splitting and Korpelevich's Methods for Hemivariational Inequalities with Applications to Saddle-point and Convex Optimization Problems
- Convergence analysis of primal-dual algorithms for a saddle-point problem: from contraction perspective
- Convergence Rate Analysis of Primal-Dual Splitting Schemes
- Convex analysis and monotone operator theory in Hilbert spaces
- Convex optimization theory.
- Distributed optimization and statistical learning via the alternating direction method of multipliers
- Introductory lectures on convex optimization. A basic course.
- Model Selection and Estimation in Regression with Grouped Variables
- Nonlinear total variation based noise removal algorithms
- On a generalization of the iterative soft-thresholding algorithm for the case of non-separable penalty
- On the convergence rate of a forward-backward type primal-dual splitting algorithm for convex optimization problems
- On the ergodic convergence rates of a first-order primal-dual algorithm
- Optimal primal-dual methods for a class of saddle point problems
- Pathwise coordinate optimization
- Primal-dual splitting algorithm for solving inclusions with mixtures of composite, Lipschitzian, and parallel-sum type monotone operators
- Signal Recovery by Proximal Forward-Backward Splitting
- Smooth minimization of non-smooth functions
- Smoothing proximal gradient method for general structured sparse regression
- Sparsity and Smoothness Via the Fused Lasso
- The solution path of the generalized lasso
- The Split Bregman Method for L1-Regularized Problems
Cited in
(6)- Optimal parallel randomized algorithms for sparse addition and identification
- New convergence analysis of a primal-dual algorithm with large stepsizes
- High-performance statistical computing in the computing environments of the 2020s
- Lipschitz Certificates for Layered Network Structures Driven by Averaged Activation Operators
- Data-driven nonsmooth optimization
- scientific article; zbMATH DE number 6796233 (Why is no real title available?)
This page was built for publication: Easily Parallelizable and Distributable Class of Algorithms for Structured Sparsity, with Optimal Acceleration
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3391206)
