GRPDA revisited: relaxed condition and connection to Chambolle-Pock's primal-dual algorithm

DOI10.1007/s10915-022-02033-0OpenAlexW4307465136MaRDI QIDQ2103452

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

zbMATH Keywords

convex combinationprimal-dual algorithmgolden ratiostructured convex optimizationergodic sublinear convergence rate

Mathematics Subject Classification ID

Convex programming (90C25) Numerical optimization and variational techniques (65K10) Complexity and performance of numerical algorithms (65Y20)

Related Items (1)

Golden ratio proximal gradient ADMM for distributed composite convex optimization

Uses Software

• PDCO

Cites Work

• Unnamed Item
• Unnamed Item
• A first-order primal-dual algorithm for convex problems with applications to imaging
• A golden ratio primal-dual algorithm for structured convex optimization
• Golden ratio algorithms for variational inequalities
• Bregman three-operator splitting methods
• Handbook of Robust Low-Rank and Sparse Matrix Decomposition
• A Low Patch-Rank Interpretation of Texture
• Convergence Analysis of Primal-Dual Algorithms for a Saddle-Point Problem: From Contraction Perspective
• 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
• Atomic Decomposition by Basis Pursuit
• A First-Order Primal-Dual Algorithm with Linesearch
• Rate of Convergence Analysis of Decomposition Methods Based on the Proximal Method of Multipliers for Convex Minimization
• Faster Lagrangian-Based Methods in Convex Optimization
• Golden Ratio Primal-Dual Algorithm with Linesearch
• On the Convergence of Primal-Dual Hybrid Gradient Algorithm
• A Convergent 3-Block SemiProximal Alternating Direction Method of Multipliers for Conic Programming with 4-Type Constraints
• Near-Optimal Compressed Sensing Guarantees for Total Variation Minimization
• Convex Analysis
• Compressed sensing

This page was built for publication: GRPDA revisited: relaxed condition and connection to Chambolle-Pock's primal-dual algorithm