GRPDA revisited: relaxed condition and connection to Chambolle-Pock's primal-dual algorithm
DOI10.1007/S10915-022-02033-0OpenAlexW4307465136MaRDI QIDQ2103452FDOQ2103452
Authors: Xiaokai Chang, Junfeng Yang 
Publication date: 13 December 2022
Published in: Journal of Scientific Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10915-022-02033-0
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
convex combinationgolden ratioprimal-dual algorithmstructured convex optimizationergodic sublinear convergence rate
Numerical optimization and variational techniques (65K10) Convex programming (90C25) Complexity and performance of numerical algorithms (65Y20)
Cites Work
- Title not available (Why is that?)
- Atomic Decomposition by Basis Pursuit
- Convex Analysis
- A convergent 3-block semiproximal alternating direction method of multipliers for conic programming with 4-type constraints
- Compressed sensing
- Handbook of robust low-rank and sparse matrix decomposition. Applications in image and video processing
- 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
- Alternating direction algorithms for \(\ell_1\)-problems in compressive sensing
- Projection methods for variational inequalities with application to the traffic assignment problem
- Convergence analysis of primal-dual algorithms for a saddle-point problem: from contraction perspective
- On the convergence of primal-dual hybrid gradient algorithm
- Title not available (Why is that?)
- Rate of Convergence Analysis of Decomposition Methods Based on the Proximal Method of Multipliers for Convex Minimization
- Bregman three-operator splitting methods
- A First-Order Primal-Dual Algorithm with Linesearch
- A low patch-rank interpretation of texture
- Near-Optimal Compressed Sensing Guarantees for Total Variation Minimization
- A golden ratio primal-dual algorithm for structured convex optimization
- Golden ratio algorithms for variational inequalities
- Faster Lagrangian-Based Methods in Convex Optimization
- Golden Ratio Primal-Dual Algorithm with Linesearch
Cited In (1)
Uses Software
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)
