A double extrapolation primal-dual algorithm for saddle point problems
DOI10.1007/s10915-020-01330-wzbMath1453.65146OpenAlexW3094379518MaRDI QIDQ2211739
Publication date: 12 November 2020
Published in: Journal of Scientific Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10915-020-01330-w
extrapolationsaddle point problemprimal-dual algorithmimage deblurringimage inpaintinglinear convergence rate
Convex programming (90C25) Variational inequalities (49J40) Image processing (compression, reconstruction, etc.) in information and communication theory (94A08) Numerical methods for variational inequalities and related problems (65K15)
Related Items (4)
Cites Work
- Unnamed Item
- Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers
- On the ergodic convergence rates of a first-order primal-dual algorithm
- An improved first-order primal-dual algorithm with a new correction step
- On the linear convergence of the alternating direction method of multipliers
- An extragradient-based alternating direction method for convex minimization
- A primal-dual prediction-correction algorithm for saddle point optimization
- Customized proximal point algorithms for linearly constrained convex minimization and saddle-point problems: a unified approach
- An operator splitting method for variational inequalities with partially unknown mappings
- An algorithmic framework of generalized primal-dual hybrid gradient methods for saddle point problems
- A first-order primal-dual algorithm for convex problems with applications to imaging
- A new proximal iterative hard thresholding method with extrapolation for \(\ell _0\) minimization
- On the global and linear convergence of the generalized alternating direction method of multipliers
- Enhanced proximal DC algorithms with extrapolation for a class of structured nonsmooth DC minimization
- Linear Convergence of the Alternating Direction Method of Multipliers for a Class of Convex Optimization Problems
- Linearized primal-dual methods for linear inverse problems with total variation regularization and finite element discretization
- Convergence Analysis of Primal-Dual Algorithms for a Saddle-Point Problem: From Contraction Perspective
- Linear Convergence of Proximal Gradient Algorithm with Extrapolation for a Class of Nonconvex Nonsmooth Minimization Problems
- A General Framework for a Class of First Order Primal-Dual Algorithms for Convex Optimization in Imaging Science
- Inertial Proximal ADMM for Linearly Constrained Separable Convex Optimization
- Calibrating Least Squares Semidefinite Programming with Equality and Inequality Constraints
- Practical Extrapolation Methods
- A First-Order Primal-Dual Algorithm with Linesearch
- Prox-Method with Rate of Convergence O(1/t) for Variational Inequalities with Lipschitz Continuous Monotone Operators and Smooth Convex-Concave Saddle Point Problems
- Finite-Dimensional Variational Inequalities and Complementarity Problems
- Metric Subregularity of Piecewise Linear Multifunctions and Applications to Piecewise Linear Multiobjective Optimization
- On the Convergence of Primal-Dual Hybrid Gradient Algorithm
- Linear Rate Convergence of the Alternating Direction Method of Multipliers for Convex Composite Programming
- Optimal Primal-Dual Methods for a Class of Saddle Point Problems
- Some methods of speeding up the convergence of iteration methods
- Convex Analysis
- Navigating in a Graph by Aid of Its Spanning Tree Metric
This page was built for publication: A double extrapolation primal-dual algorithm for saddle point problems