Fast convergence of the primal-dual dynamical system and corresponding algorithms for a nonsmooth bilinearly coupled saddle point problem
DOI10.1007/S10589-024-00626-ZMaRDI QIDQ6667694
Jörg Fliege, Kewei Ding, Phan Tu Vuong
Publication date: 20 January 2025
Published in: Computational Optimization and Applications (Search for Journal in Brave)
convergence ratesaddle point problemnumerical algorithmNesterov's accelerated gradient methodprimal-dual dynamical systemiterates convergence
Analysis of algorithms and problem complexity (68Q25) Convex programming (90C25) Numerical optimization and variational techniques (65K10) Existence of solutions for minimax problems (49J35) Dynamical systems in optimization and economics (37N40) Mathematical programming (90Cxx)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- On the ergodic convergence rates of a first-order primal-dual algorithm
- Fast convex optimization via inertial dynamics with Hessian driven damping
- A primal-dual splitting method for convex optimization involving Lipschitzian, proximable and linear composite terms
- On the convergence of the iterates of the ``fast iterative shrinkage/thresholding algorithm
- A first-order primal-dual algorithm for convex problems with applications to imaging
- Fast primal-dual algorithm via dynamical system for a linearly constrained convex optimization problem
- A unified convergence rate analysis of the accelerated smoothed gap reduction algorithm
- Fast convergence of dynamical ADMM via time scaling of damped inertial dynamics
- Inertial accelerated primal-dual methods for linear equality constrained convex optimization problems
- Applying FISTA to optimization problems (with or) without minimizers
- Improved convergence rates and trajectory convergence for primal-dual dynamical systems with vanishing damping
- Fast convergence of inertial dynamics and algorithms with asymptotic vanishing viscosity
- The rate of convergence of Nesterov's accelerated forward-backward method is actually faster than \(1/k^2\)
- A differential equation for modeling Nesterov's accelerated gradient method: theory and insights
- A General Framework for a Class of First Order Primal-Dual Algorithms for Convex Optimization in Imaging Science
- Convergence Rates of Damped Inertial Dynamics under Geometric Conditions and Perturbations
- Splitting Algorithms for the Sum of Two Nonlinear Operators
- Convergence Rates of Inertial Forward-Backward Algorithms
- Asymptotic for a second-order evolution equation with convex potential andvanishing damping term
- Two Steps at a Time---Taking GAN Training in Stride with Tseng's Method
- A Generalized Primal-Dual Algorithm with Improved Convergence Condition for Saddle Point Problems
- Convergence Rate of $\mathcal{O}(1/k)$ for Optimistic Gradient and Extragradient Methods in Smooth Convex-Concave Saddle Point Problems
- Optimal Primal-Dual Methods for a Class of Saddle Point Problems
- Approximate first-order primal-dual algorithms for saddle point problems
- Convex analysis and monotone operator theory in Hilbert spaces
- Fast augmented Lagrangian method in the convex regime with convergence guarantees for the iterates
- An accelerated minimax algorithm for convex-concave saddle point problems with nonsmooth coupling function
- A second order primal-dual dynamical system for a convex-concave bilinear saddle point problem
This page was built for publication: Fast convergence of the primal-dual dynamical system and corresponding algorithms for a nonsmooth bilinearly coupled saddle point problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6667694)