Block-proximal methods with spatially adapted acceleration
From MaRDI portal
Publication:2323015
DOI10.1553/etna_vol51s15zbMath1420.49034arXiv1609.07373OpenAlexW2526813860MaRDI QIDQ2323015
Publication date: 30 August 2019
Published in: ETNA. Electronic Transactions on Numerical Analysis (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1609.07373
Minimax problems in mathematical programming (90C47) Nonlinear programming (90C30) Numerical methods involving duality (49M29) Numerical optimization and variational techniques (65K10) Numerical methods for variational inequalities and related problems (65K15)
Related Items
Inertial, Corrected, Primal-Dual Proximal Splitting ⋮ Testing and non-linear preconditioning of the proximal point method ⋮ An alternative extrapolation scheme of PDHGM for saddle point problem with nonlinear function ⋮ Primal-dual block-proximal splitting for a class of non-convex problems ⋮ Relaxed Gauss--Newton Methods with Applications to Electrical Impedance Tomography ⋮ Acceleration and Global Convergence of a First-Order Primal-Dual Method for Nonconvex Problems ⋮ Preconditioned proximal point methods and notions of partial subregularity
Uses Software
Cites Work
- 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
- A primal-dual splitting method for convex optimization involving Lipschitzian, proximable and linear composite terms
- Proximal alternating linearized minimization for nonconvex and nonsmooth problems
- Bilevel parameter learning for higher-order total variation regularisation models
- Coordinate-friendly structures, algorithms and applications
- Acceleration of the PDHGM on partially strongly convex functions
- An algorithm for mean curvature motion
- A first-order primal-dual algorithm for convex problems with applications to imaging
- A splitting algorithm for dual monotone inclusions involving cocoercive operators
- Testing and non-linear preconditioning of the proximal point method
- Coordinate descent algorithms
- A Class of Randomized Primal-Dual Algorithms for Distributed Optimization
- Distributed Coordinate Descent Method for Learning with Big Data
- ARock: An Algorithmic Framework for Asynchronous Parallel Coordinate Updates
- Optimization in High Dimensions via Accelerated, Parallel, and Proximal Coordinate Descent
- Total Generalized Variation in Diffusion Tensor Imaging
- iPiano: Inertial Proximal Algorithm for Nonconvex Optimization
- Efficiency of Coordinate Descent Methods on Huge-Scale Optimization Problems
- Convergence Analysis of Primal-Dual Algorithms for a Saddle-Point Problem: From Contraction Perspective
- A General Framework for a Class of First Order Primal-Dual Algorithms for Convex Optimization in Imaging Science
- Stochastic Primal-Dual Coordinate Method for Regularized Empirical Risk Minimization
- An iterative thresholding algorithm for linear inverse problems with a sparsity constraint
- Block-wise Alternating Direction Method of Multipliers for Multiple-block Convex Programming and Beyond
- Inertial, Corrected, Primal-Dual Proximal Splitting
- On the Convergence of Primal-Dual Hybrid Gradient Algorithm
- Optimal Primal-Dual Methods for a Class of Saddle Point Problems
- The Primal-Dual Hybrid Gradient Method for Semiconvex Splittings
- Accelerated proximal stochastic dual coordinate ascent for regularized loss minimization
