Stochastic Primal-Dual Hybrid Gradient Algorithm with Arbitrary Sampling and Imaging Applications
From MaRDI portal
Publication:4687241
DOI10.1137/17M1134834OpenAlexW2625685405WikidataQ129144029 ScholiaQ129144029MaRDI QIDQ4687241
Peter Richtárik, Matthias J. Ehrhardt, Carola-Bibiane Schönlieb, Antonin Chambolle
Publication date: 11 October 2018
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1706.04957
Convex programming (90C25) Numerical optimization and variational techniques (65K10) Stochastic programming (90C15) Biomedical imaging and signal processing (92C55) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Image processing (compression, reconstruction, etc.) in information and communication theory (94A08) Stochastic and other probabilistic methods applied to problems in solid mechanics (74S60)
Related Items (37)
A new randomized primal-dual algorithm for convex optimization with fast last iterate convergence rates ⋮ Convergence properties of a randomized primal-dual algorithm with applications to parallel MRI ⋮ Deep learning for inverse problems. Abstracts from the workshop held March 7--13, 2021 (hybrid meeting) ⋮ Inertial stochastic PALM and applications in machine learning ⋮ Unnamed Item ⋮ On the Convergence of Stochastic Primal-Dual Hybrid Gradient ⋮ Golden Ratio Primal-Dual Algorithm with Linesearch ⋮ Inexact first-order primal-dual algorithms ⋮ Unified linear convergence of first-order primal-dual algorithms for saddle point problems ⋮ Analysis of the Frank-Wolfe method for convex composite optimization involving a logarithmically-homogeneous barrier ⋮ Proximal Splitting Algorithms for Convex Optimization: A Tour of Recent Advances, with New Twists ⋮ Cyclic Coordinate Dual Averaging with Extrapolation ⋮ Unnamed Item ⋮ An alternative extrapolation scheme of PDHGM for saddle point problem with nonlinear function ⋮ Variable smoothing for convex optimization problems using stochastic gradients ⋮ Primal-dual block-proximal splitting for a class of non-convex problems ⋮ Primal-dual incremental gradient method for nonsmooth and convex optimization problems ⋮ A first-order inexact primal-dual algorithm for a class of convex-concave saddle point problems ⋮ A Randomized Exchange Algorithm for Computing Optimal Approximate Designs of Experiments ⋮ A Coordinate-Descent Primal-Dual Algorithm with Large Step Size and Possibly Nonseparable Functions ⋮ Unnamed Item ⋮ The distance between convex sets with Minkowski sum structure: application to collision detection ⋮ Momentum and stochastic momentum for stochastic gradient, Newton, proximal point and subspace descent methods ⋮ A golden ratio primal-dual algorithm for structured convex optimization ⋮ Variable smoothing for weakly convex composite functions ⋮ Non-stationary First-Order Primal-Dual Algorithms with Faster Convergence Rates ⋮ Analysis of stochastic gradient descent in continuous time ⋮ An inexact proximal augmented Lagrangian framework with arbitrary linearly convergent inner solver for composite convex optimization ⋮ Backtracking Strategies for Accelerated Descent Methods with Smooth Composite Objectives ⋮ Stochastic primal dual fixed point method for composite optimization ⋮ High-performance statistical computing in the computing environments of the 2020s ⋮ Convergence Analysis of Inexact Randomized Iterative Methods ⋮ A Stochastic Variance Reduced Primal Dual Fixed Point Method for Linearly Constrained Separable Optimization ⋮ A generic coordinate descent solver for non-smooth convex optimisation ⋮ A Stochastic Proximal Alternating Minimization for Nonsmooth and Nonconvex Optimization ⋮ An inexact accelerated stochastic ADMM for separable convex optimization ⋮ A hybrid stochastic optimization framework for composite nonconvex optimization
Uses Software
Cites Work
- Unnamed Item
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- Parallel coordinate descent methods for big data optimization
- On the ergodic convergence rates of a first-order primal-dual algorithm
- On optimal probabilities in stochastic coordinate descent methods
- Nonlinear spectral analysis via one-homogeneous functionals: overview and future prospects
- Minimizing finite sums with the stochastic average gradient
- Incremental proximal methods for large scale convex optimization
- An algorithm for total variation minimization and applications
- Coordinate-friendly structures, algorithms and applications
- A first-order primal-dual algorithm for convex problems with applications to imaging
- Iteration complexity of randomized block-coordinate descent methods for minimizing a composite function
- Incremental Subgradient Methods for Nondifferentiable Optimization
- A Class of Randomized Primal-Dual Algorithms for Distributed Optimization
- A TGV-Based Framework for Variational Image Decompression, Zooming, and Reconstruction. Part I: Analytics
- Coordinate descent with arbitrary sampling I: algorithms and complexity†
- String-averaging incremental subgradients for constrained convex optimization with applications to reconstruction of tomographic images
- A General Framework for a Class of First Order Primal-Dual Algorithms for Convex Optimization in Imaging Science
- Accelerated, Parallel, and Proximal Coordinate Descent
- Splitting Algorithms for the Sum of Two Nonlinear Operators
- An Incremental Gradient(-Projection) Method with Momentum Term and Adaptive Stepsize Rule
- Adaptive Regularization With the Structure Tensor
- A Convergent Incremental Gradient Method with a Constant Step Size
- Stochastic Quasi-Fejér Block-Coordinate Fixed Point Iterations with Random Sweeping
- Convex Analysis
- An introduction to continuous optimization for imaging
- Convex analysis and monotone operator theory in Hilbert spaces
This page was built for publication: Stochastic Primal-Dual Hybrid Gradient Algorithm with Arbitrary Sampling and Imaging Applications
