A golden ratio primal-dual algorithm for structured convex optimization
From MaRDI portal
Publication:2025858
DOI10.1007/s10915-021-01452-9zbMath1468.90082arXiv1910.13260OpenAlexW3137879310MaRDI QIDQ2025858
Publication date: 17 May 2021
Published in: Journal of Scientific Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1910.13260
convergence rateaccelerationfixed point iterationsaddle point problemprimal-dual algorithmgolden ratiostructured convex optimization
Convex programming (90C25) Numerical optimization and variational techniques (65K10) Complexity and performance of numerical algorithms (65Y20)
Related Items
Golden Ratio Primal-Dual Algorithm with Linesearch ⋮ A golden ratio proximal alternating direction method of multipliers for separable convex optimization ⋮ A partially inexact generalized primal-dual hybrid gradient method for saddle point problems with bilinear couplings ⋮ Golden ratio proximal gradient ADMM for distributed composite convex optimization ⋮ Solving saddle point problems: a landscape of primal-dual algorithm with larger stepsizes ⋮ GRPDA revisited: relaxed condition and connection to Chambolle-Pock's primal-dual algorithm
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- On the ergodic convergence rates of a first-order primal-dual algorithm
- Subgradient methods for saddle-point problems
- On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators
- A dual algorithm for the solution of nonlinear variational problems via finite element approximation
- A first-order primal-dual algorithm for convex problems with applications to imaging
- Golden ratio algorithms for variational inequalities
- Atomic Decomposition by Basis Pursuit
- Handbook of Robust Low-Rank and Sparse Matrix Decomposition
- Hankel Matrix Rank Minimization with Applications to System Identification and Realization
- 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
- Complexity of Variants of Tseng's Modified F-B Splitting and Korpelevich's Methods for Hemivariational Inequalities with Applications to Saddle-point and Convex Optimization Problems
- Splitting Algorithms for the Sum of Two Nonlinear Operators
- LSQR: An Algorithm for Sparse Linear Equations and Sparse Least Squares
- Projection methods for variational inequalities with application to the traffic assignment problem
- First-Order Methods in Optimization
- A First-Order Primal-Dual Algorithm with Linesearch
- Prox-Method with Rate of Convergence O(1/t) for Variational Inequalities with Lipschitz Continuous Monotone Operators and Smooth Convex-Concave Saddle Point Problems
- Stochastic Primal-Dual Hybrid Gradient Algorithm with Arbitrary Sampling and Imaging Applications
- Rate of Convergence Analysis of Decomposition Methods Based on the Proximal Method of Multipliers for Convex Minimization
- Near-Optimal Compressed Sensing Guarantees for Total Variation Minimization
- Convex analysis and monotone operator theory in Hilbert spaces
- Compressed sensing
