Acceleration of primal-dual methods by preconditioning and simple subproblem procedures
From MaRDI portal
Publication:2027970
DOI10.1007/s10915-020-01371-1zbMath1464.49018arXiv1811.08937MaRDI QIDQ2027970
Wotao Yin, Yunbei Xu, Yanli Liu
Publication date: 28 May 2021
Published in: Journal of Scientific Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1811.08937
preconditioning; acceleration; alternating direction method of multipliers; primal-dual hybrid gradient
90C25: Convex programming
49M29: Numerical methods involving duality
65K10: Numerical optimization and variational techniques
65Y20: Complexity and performance of numerical algorithms
Related Items
Unnamed Item, Golden Ratio Primal-Dual Algorithm with Linesearch, Approximate first-order primal-dual algorithms for saddle point problems, An inexact primal-dual method with correction step for a saddle point problem in image debluring, Structure Preserving Primal Dual Methods for Gradient Flows with Nonlinear Mobility Transport Distances, Understanding the convergence of the preconditioned PDHG method: a view of indefinite proximal ADMM, Bregman three-operator splitting methods, An alternative extrapolation scheme of PDHGM for saddle point problem with nonlinear function
Uses Software
Cites Work
- Unnamed Item
- Smooth minimization of non-smooth functions
- On the ergodic convergence rates of a first-order primal-dual algorithm
- Moreau's decomposition in Banach spaces
- A primal-dual splitting method for convex optimization involving Lipschitzian, proximable and linear composite terms
- Fast alternating linearization methods for minimizing the sum of two convex functions
- Stability of primal-dual gradient dynamics and applications to network optimization
- A unified primal-dual algorithm framework based on Bregman iteration
- On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators
- Relative-error approximate versions of Douglas-Rachford splitting and special cases of the ADMM
- Approximate ADMM algorithms derived from Lagrangian splitting
- Global convergence of ADMM in nonconvex nonsmooth optimization
- A parallel method for earth mover's distance
- Templates for convex cone problems with applications to sparse signal recovery
- A first-order primal-dual algorithm for convex problems with applications to imaging
- Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods
- A splitting algorithm for dual monotone inclusions involving cocoercive operators
- Inexact first-order primal-dual algorithms
- Coordinate descent algorithms
- Adaptive restart for accelerated gradient schemes
- A proximal point analysis of the preconditioned alternating direction method of multipliers
- AIR tools II: algebraic iterative reconstruction methods, improved implementation
- Inexact alternating direction methods of multipliers with logarithmic-quadratic proximal regularization
- An optimal transport approach for seismic tomography: application to 3D full waveform inversion
- A Variable Metric Extension of the Forward–Backward–Forward Algorithm for Monotone Operators
- Convergence Analysis of Primal-Dual Algorithms for a Saddle-Point Problem: From Contraction Perspective
- Linear Convergence and Metric Selection for Douglas-Rachford Splitting and ADMM
- A General Framework for a Class of First Order Primal-Dual Algorithms for Convex Optimization in Imaging Science
- Inexact Alternating Direction Methods for Image Recovery
- A Monotone+Skew Splitting Model for Composite Monotone Inclusions in Duality
- An Accelerated Randomized Proximal Coordinate Gradient Method and its Application to Regularized Empirical Risk Minimization
- An Accelerated HPE-Type Algorithm for a Class of Composite Convex-Concave Saddle-Point Problems
- Variational Analysis
- Forward-Backward-Half Forward Algorithm for Solving Monotone Inclusions
- Accelerated First-Order Primal-Dual Proximal Methods for Linearly Constrained Composite Convex Programming
- A primal–dual hybrid gradient method for nonlinear operators with applications to MRI
- Fast Alternating Direction Optimization Methods
- Nonconvex Lagrangian-Based Optimization: Monitoring Schemes and Global Convergence
- Optimal Primal-Dual Methods for a Class of Saddle Point Problems
- An Accelerated Linearized Alternating Direction Method of Multipliers
- Preconditioned Douglas--Rachford Splitting Methods for Convex-concave Saddle-point Problems
- Cyclic Coordinate-Update Algorithms for Fixed-Point Problems: Analysis and Applications
- Self Equivalence of the Alternating Direction Method of Multipliers
- Variable metric forward–backward splitting with applications to monotone inclusions in duality
- Convex analysis and monotone operator theory in Hilbert spaces
