Optimal Primal-Dual Methods for a Class of Saddle Point Problems
From MaRDI portal
Publication:5245366
DOI10.1137/130919362zbMath1329.90090arXiv1309.5548OpenAlexW2092851214MaRDI QIDQ5245366
Yuyuan Ouyang, Yunmei Chen, Guanghui Lan
Publication date: 8 April 2015
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1309.5548
Related Items (70)
A new randomized primal-dual algorithm for convex optimization with fast last iterate convergence rates ⋮ Reducing the Complexity of Two Classes of Optimization Problems by Inexact Accelerated Proximal Gradient Method ⋮ Local saddle points for unconstrained polynomial optimization ⋮ A unified convergence rate analysis of the accelerated smoothed gap reduction algorithm ⋮ Stochastic accelerated alternating direction method of multipliers with importance sampling ⋮ Accelerated gradient sliding for structured convex optimization ⋮ On the ergodic convergence rates of a first-order primal-dual algorithm ⋮ On the global convergence rate of the gradient descent method for functions with Hölder continuous gradients ⋮ Adaptive primal-dual stochastic gradient method for expectation-constrained convex stochastic programs ⋮ An Accelerated HPE-Type Algorithm for a Class of Composite Convex-Concave Saddle-Point Problems ⋮ The saddle point problem of polynomials ⋮ On the linear convergence of the general first order primal-dual algorithm ⋮ Accelerated Stochastic Algorithms for Convex-Concave Saddle-Point Problems ⋮ A three-stage approach for segmenting degraded color images: smoothing, lifting and thresholding (SLaT) ⋮ An efficient adaptive accelerated inexact proximal point method for solving linearly constrained nonconvex composite problems ⋮ Algorithms for stochastic optimization with function or expectation constraints ⋮ Accelerated schemes for a class of variational inequalities ⋮ Fast augmented Lagrangian method in the convex regime with convergence guarantees for the iterates ⋮ Fast bundle-level methods for unconstrained and ball-constrained convex optimization ⋮ Adaptively weighted difference model of anisotropic and isotropic total variation for image denoising ⋮ A stochastic variance reduction algorithm with Bregman distances for structured composite problems ⋮ A unified single-loop alternating gradient projection algorithm for nonconvex-concave and convex-nonconcave minimax problems ⋮ No-regret dynamics in the Fenchel game: a unified framework for algorithmic convex optimization ⋮ Optimality Conditions for Nonsmooth Nonconvex-Nonconcave Min-Max Problems and Generative Adversarial Networks ⋮ Primal-Dual First-Order Methods for Affinely Constrained Multi-block Saddle Point Problems ⋮ A Smooth Primal-Dual Optimization Framework for Nonsmooth Composite Convex Minimization ⋮ Stochastic first-order methods for convex and nonconvex functional constrained optimization ⋮ An Inverse-Adjusted Best Response Algorithm for Nash Equilibria ⋮ Primal-Dual Stochastic Gradient Method for Convex Programs with Many Functional Constraints ⋮ Single image blind deblurring based on the fractional-order differential ⋮ Acceleration of the PDHGM on partially strongly convex functions ⋮ An alternative extrapolation scheme of PDHGM for saddle point problem with nonlinear function ⋮ A double extrapolation primal-dual algorithm for saddle point problems ⋮ Lower complexity bounds of first-order methods for convex-concave bilinear saddle-point problems ⋮ Convergence Rate of $\mathcal{O}(1/k)$ for Optimistic Gradient and Extragradient Methods in Smooth Convex-Concave Saddle Point Problems ⋮ Reducing spatially varying out-of-focus blur from natural image ⋮ Modified algorithms for image inpainting in Fourier transform domain ⋮ Solving structured nonsmooth convex optimization with complexity \(\mathcal {O}(\varepsilon ^{-1/2})\) ⋮ Accelerated primal-dual proximal block coordinate updating methods for constrained convex optimization ⋮ An introduction to continuous optimization for imaging ⋮ Point process estimation with Mirror Prox algorithms ⋮ Dynamic stochastic approximation for multi-stage stochastic optimization ⋮ A prediction-correction-based primal-dual hybrid gradient method for linearly constrained convex minimization ⋮ Acceleration of primal-dual methods by preconditioning and simple subproblem procedures ⋮ An optimal randomized incremental gradient method ⋮ A primal-dual prediction-correction algorithm for saddle point optimization ⋮ A New Algorithm Framework for Image Inpainting in Transform Domain ⋮ A Distributed ADMM-like Method for Resource Sharing over Time-Varying Networks ⋮ Distributed and consensus optimization for non-smooth image reconstruction ⋮ An $\mathcal O(1/{k})$ Convergence Rate for the Variable Stepsize Bregman Operator Splitting Algorithm ⋮ A FISTA-type accelerated gradient algorithm for solving smooth nonconvex composite optimization problems ⋮ Communication-efficient algorithms for decentralized and stochastic optimization ⋮ Conditional Gradient Sliding for Convex Optimization ⋮ Non-stationary First-Order Primal-Dual Algorithms with Faster Convergence Rates ⋮ Accelerated First-Order Primal-Dual Proximal Methods for Linearly Constrained Composite Convex Programming ⋮ Saddle points of rational functions ⋮ Easily Parallelizable and Distributable Class of Algorithms for Structured Sparsity, with Optimal Acceleration ⋮ Accelerated first-order methods for large-scale convex optimization: nearly optimal complexity under strong convexity ⋮ Accelerated alternating direction method of multipliers: an optimal \(O(1 / K)\) nonergodic analysis ⋮ Optimal subgradient methods: computational properties for large-scale linear inverse problems ⋮ A Primal-Dual Algorithm with Line Search for General Convex-Concave Saddle Point Problems ⋮ A new algorithm for image inpainting in Fourier transform domain ⋮ Block-proximal methods with spatially adapted acceleration ⋮ Stochastic primal dual fixed point method for composite optimization ⋮ Stochastic relaxed inertial forward-backward-forward splitting for monotone inclusions in Hilbert spaces ⋮ An Accelerated Linearized Alternating Direction Method of Multipliers ⋮ High-performance statistical computing in the computing environments of the 2020s ⋮ A relaxed parameter condition for the primal-dual hybrid gradient method for saddle-point problem ⋮ A Stochastic Variance Reduced Primal Dual Fixed Point Method for Linearly Constrained Separable Optimization ⋮ Accelerated Non-Overlapping Domain Decomposition Method for Total Variation Minimization
This page was built for publication: Optimal Primal-Dual Methods for a Class of Saddle Point Problems
