A partially inexact generalized primal-dual hybrid gradient method for saddle point problems with bilinear couplings
From MaRDI portal
Publication:6093347
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
Cites work
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- A customized Douglas-Rachford splitting algorithm for separable convex minimization with linear constraints
- A double extrapolation primal-dual algorithm for saddle point problems
- A first-order inexact primal-dual algorithm for a class of convex-concave saddle point problems
- A first-order primal-dual algorithm for convex problems with applications to imaging
- A first-order primal-dual algorithm with linesearch
- A general framework for a class of first order primal-dual algorithms for convex optimization in imaging science
- A golden ratio primal-dual algorithm for structured convex optimization
- A new primal-dual algorithm for minimizing the sum of three functions with a linear operator
- A primal-dual prediction-correction algorithm for saddle point optimization
- A primal-dual splitting method for convex optimization involving Lipschitzian, proximable and linear composite terms
- A primal–dual fixed point algorithm for convex separable minimization with applications to image restoration
- An algorithmic framework of generalized primal-dual hybrid gradient methods for saddle point problems
- An improved first-order primal-dual algorithm with a new correction step
- An inexact alternating direction method of multipliers with relative error criteria
- Approximate first-order primal-dual algorithms for saddle point problems
- Convergence analysis of primal-dual algorithms for a saddle-point problem: from contraction perspective
- Customized proximal point algorithms for linearly constrained convex minimization and saddle-point problems: a unified approach
- Finite-Dimensional Variational Inequalities and Complementarity Problems
- General Inexact Primal-Dual Hybrid Gradient Methods for Saddle-Point Problems and Convergence Analysis
- Inexact first-order primal-dual algorithms
- Introductory lectures on convex optimization. A basic course.
- Linear Rate Convergence of the Alternating Direction Method of Multipliers for Convex Composite Programming
- 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
- Metric Subregularity of Piecewise Linear Multifunctions and Applications to Piecewise Linear Multiobjective Optimization
- On the convergence of primal-dual hybrid gradient algorithm
- On the ergodic convergence rates of a first-order primal-dual algorithm
- Some projection methods with the BB step sizes for variational inequalities
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)
