GRPDA revisited: relaxed condition and connection to Chambolle-Pock's primal-dual algorithm
From MaRDI portal
Publication:2103452
Recommendations
- A golden ratio primal-dual algorithm for structured convex optimization
- scientific article; zbMATH DE number 7668280
- Golden ratio primal-dual algorithm with linesearch
- A new primal-dual algorithm for structured convex optimization involving a Lipschitzian term
- A generalized primal-dual algorithm with improved convergence condition for saddle point problems
Cites work
- A convergent 3-block semiproximal alternating direction method of multipliers for conic programming with 4-type constraints
- 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 low patch-rank interpretation of texture
- Alternating direction algorithms for \(\ell_1\)-problems in compressive sensing
- Atomic Decomposition by Basis Pursuit
- Bregman three-operator splitting methods
- Compressed sensing
- Convergence analysis of primal-dual algorithms for a saddle-point problem: from contraction perspective
- Convex Analysis
- Faster Lagrangian-based methods in convex optimization
- Golden ratio algorithms for variational inequalities
- Golden ratio primal-dual algorithm with linesearch
- Handbook of robust low-rank and sparse matrix decomposition. Applications in image and video processing
- scientific article; zbMATH DE number 3148887 (Why is no real title available?)
- scientific article; zbMATH DE number 845714 (Why is no real title available?)
- Near-Optimal Compressed Sensing Guarantees for Total Variation Minimization
- On the convergence of primal-dual hybrid gradient algorithm
- Projection methods for variational inequalities with application to the traffic assignment problem
- Rate of Convergence Analysis of Decomposition Methods Based on the Proximal Method of Multipliers for Convex Minimization
Cited in
(11)- A golden ratio primal-dual algorithm for structured convex optimization
- Golden ratio primal-dual algorithm with linesearch
- Golden ratio proximal gradient ADMM for distributed composite convex optimization
- The golden ratio primal-dual algorithm with two new stepsize rules for convex-concave saddle point problems
- A fast generalized prediction-correction dual-primal hybrid gradient algorithm for bilinear saddle point problems with applications to total variation image processing
- A splitting preconditioned primal-dual algorithm with interpolation and extrapolation for bilinear saddle point problem
- A primal-dual splitting algorithm with convex combination and larger step sizes for composite monotone inclusion problems
- Preconditioned golden ratio primal-dual algorithm with linesearch
- A step-free primal-dual algorithm for solving bilinear saddle point problem
- Adaptive primal-dual algorithms for generic saddle point problems
- A primal-dual algorithm with coupled extrapolation: bridging the Chambolle-Pock and Peaceman-Rachford methods
This page was built for publication: GRPDA revisited: relaxed condition and connection to Chambolle-Pock's primal-dual algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2103452)
