A unified convergence rate analysis of the accelerated smoothed gap reduction algorithm
From MaRDI portal
Publication:2128772
DOI10.1007/s11590-021-01775-4zbMath1491.90182arXiv2104.01314OpenAlexW3178689845MaRDI QIDQ2128772
Publication date: 22 April 2022
Published in: Optimization Letters (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2104.01314
primal-dual algorithmNesterov's smoothing techniqueaccelerated smoothed gap reductionconvex-concave saddle-point problem
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Smooth minimization of non-smooth functions
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- On the ergodic convergence rates of a first-order primal-dual algorithm
- Combining Lagrangian decomposition and excessive gap smoothing technique for solving large-scale separable convex optimization problems
- Gradient methods for minimizing composite functions
- A primal-dual splitting method for convex optimization involving Lipschitzian, proximable and linear composite terms
- A three-operator splitting scheme and its optimization applications
- Introductory lectures on convex optimization. A basic course.
- A first-order primal-dual algorithm for convex problems with applications to imaging
- Variable smoothing for convex optimization problems using stochastic gradients
- Lower complexity bounds of first-order methods for convex-concave bilinear saddle-point problems
- An adaptive primal-dual framework for nonsmooth convex minimization
- A Variable Metric Extension of the Forward–Backward–Forward Algorithm for Monotone Operators
- On the $O(1/n)$ Convergence Rate of the Douglas–Rachford Alternating Direction Method
- Convergence Rate Analysis of Primal-Dual Splitting Schemes
- A General Framework for a Class of First Order Primal-Dual Algorithms for Convex Optimization in Imaging Science
- Square-root lasso: pivotal recovery of sparse signals via conic programming
- A Smooth Primal-Dual Optimization Framework for Nonsmooth Composite Convex Minimization
- Non-stationary First-Order Primal-Dual Algorithms with Faster Convergence Rates
- Faster Lagrangian-Based Methods in Convex Optimization
- Inertial, Corrected, Primal-Dual Proximal Splitting
- Primal-Dual Decomposition by Operator Splitting and Applications to Image Deblurring
- Optimal Primal-Dual Methods for a Class of Saddle Point Problems
- Regularization and Variable Selection Via the Elastic Net
- Convex analysis and monotone operator theory in Hilbert spaces
This page was built for publication: A unified convergence rate analysis of the accelerated smoothed gap reduction algorithm
