A partially inexact generalized primal-dual hybrid gradient method for saddle point problems with bilinear couplings
DOI10.1007/S12190-023-01899-ZzbMATH Open1522.65099OpenAlexW4385416374MaRDI QIDQ6093347FDOQ6093347
Authors: Kai Wang, Jintao Yu, Hongjin He 
Publication date: 6 October 2023
Published in: Journal of Applied Mathematics and Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s12190-023-01899-z
Recommendations
- General Inexact Primal-Dual Hybrid Gradient Methods for Saddle-Point Problems and Convergence Analysis
- A new primal-dual algorithm for solving saddle-point problems
- A double extrapolation primal-dual algorithm for saddle point problems
- Solving saddle point problems: a landscape of primal-dual algorithm with larger stepsizes
- An algorithmic framework of generalized primal-dual hybrid gradient methods for saddle point problems
error boundsaddle point problemlinear convergenceprediction-correctionprimal-dual hybrid gradient algorithm
Numerical mathematical programming methods (65K05) Convex programming (90C25) Image processing (compression, reconstruction, etc.) in information and communication theory (94A08)
Cites Work
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- Introductory lectures on convex optimization. A basic course.
- Finite-Dimensional Variational Inequalities and Complementarity 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
- Convergence analysis of primal-dual algorithms for a saddle-point problem: from contraction perspective
- A primal-dual splitting method for convex optimization involving Lipschitzian, proximable and linear composite terms
- On the convergence of primal-dual hybrid gradient algorithm
- Customized proximal point algorithms for linearly constrained convex minimization and saddle-point problems: a unified approach
- A customized Douglas-Rachford splitting algorithm for separable convex minimization with linear constraints
- A primal–dual fixed point algorithm for convex separable minimization with applications to image restoration
- On the ergodic convergence rates of a first-order primal-dual algorithm
- Inexact first-order primal-dual algorithms
- A first-order inexact primal-dual algorithm for a class of convex-concave saddle point problems
- An improved first-order primal-dual algorithm with a new correction step
- A first-order primal-dual algorithm with linesearch
- Metric Subregularity of Piecewise Linear Multifunctions and Applications to Piecewise Linear Multiobjective Optimization
- Linearized primal-dual methods for linear inverse problems with total variation regularization and finite element discretization
- Linear convergence of the alternating direction method of multipliers for a class of convex optimization problems
- An inexact alternating direction method of multipliers with relative error criteria
- A primal-dual prediction-correction algorithm for saddle point optimization
- Some projection methods with the BB step sizes for variational inequalities
- Linear Rate Convergence of the Alternating Direction Method of Multipliers for Convex Composite Programming
- A golden ratio primal-dual algorithm for structured convex optimization
- An algorithmic framework of generalized primal-dual hybrid gradient methods for saddle point problems
- A new primal-dual algorithm for minimizing the sum of three functions with a linear operator
- A double extrapolation primal-dual algorithm for saddle point problems
- Approximate first-order primal-dual algorithms for saddle point problems
- General Inexact Primal-Dual Hybrid Gradient Methods for Saddle-Point Problems and Convergence Analysis
Cited In (5)
- A double extrapolation primal-dual algorithm for saddle point problems
- A new primal-dual algorithm for solving saddle-point problems
- General Inexact Primal-Dual Hybrid Gradient Methods for Saddle-Point Problems and Convergence Analysis
- An algorithmic framework of generalized primal-dual hybrid gradient methods for saddle point problems
- An alternative extrapolation scheme of PDHGM for saddle point problem with nonlinear function
This page was built for publication: A partially inexact generalized primal-dual hybrid gradient method for saddle point problems with bilinear couplings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6093347)
