New convergence analysis of a primal-dual algorithm with large stepsizes
From MaRDI portal
Publication:2026110
DOI10.1007/s10444-020-09840-9OpenAlexW3126592366MaRDI QIDQ2026110
Publication date: 18 May 2021
Published in: Advances in Computational Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1711.06785
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Related Items
Solving saddle point problems: a landscape of primal-dual algorithm with larger stepsizes, An alternative extrapolation scheme of PDHGM for saddle point problem with nonlinear function
Cites Work
- Unnamed Item
- A primal-dual fixed point algorithm for minimization of the sum of three convex separable functions
- On the ergodic convergence rates of a first-order primal-dual algorithm
- A primal-dual splitting method for convex optimization involving Lipschitzian, proximable and linear composite terms
- Primal-dual splitting algorithm for solving inclusions with mixtures of composite, Lipschitzian, and parallel-sum type monotone operators
- A three-operator splitting scheme and its optimization applications
- A new primal-dual algorithm for minimizing the sum of three functions with a linear operator
- A simple algorithm for a class of nonsmooth convex-concave saddle-point problems
- A first-order primal-dual algorithm for convex problems with applications to imaging
- A splitting algorithm for dual monotone inclusions involving cocoercive operators
- On the convergence rate improvement of a primal-dual splitting algorithm for solving monotone inclusion problems
- Asymmetric forward-backward-adjoint splitting for solving monotone inclusions involving three operators
- Construction of fixed points of demicompact mappings in Hilbert space
- On a generalization of the iterative soft-thresholding algorithm for the case of non-separable penalty
- Easily Parallelizable and Distributable Class of Algorithms for Structured Sparsity, with Optimal Acceleration
- A Proximal Gradient Algorithm for Decentralized Composite Optimization
- Linearized augmented Lagrangian and alternating direction methods for nuclear norm minimization
- A primal–dual fixed point algorithm for convex separable minimization with applications to image restoration
- Optimal proximal augmented Lagrangian method and its application to full Jacobian splitting for multi-block separable convex minimization problems
- Primal-Dual Stochastic Gradient Method for Convex Programs with Many Functional Constraints
- A Decentralized Proximal-Gradient Method With Network Independent Step-Sizes and Separated Convergence Rates
- A Douglas--Rachford Type Primal-Dual Method for Solving Inclusions with Mixtures of Composite and Parallel-Sum Type Monotone Operators
- An introduction to continuous optimization for imaging
- Convex analysis and monotone operator theory in Hilbert spaces
