A simple algorithm for a class of nonsmooth convex-concave saddle-point problems
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 2214311
- An algorithm for a constrained saddle point problem via an exact penalty method
- Optimization of one class of nonsymmetrizable algorithms for saddle point problems
- On saddle points and optima for non-smooth and non-convex programs
- An algorithm for linearly constrained convex nondifferentiable minimization problems
- scientific article; zbMATH DE number 4076972
- scientific article; zbMATH DE number 1935541
- Algorithmic Applications in Management
- A continuous algorithm for finding the saddle points of convex-concave functions
- A primal-dual algorithm framework for convex saddle-point optimization
Cites work
- scientific article; zbMATH DE number 3833218 (Why is no real title available?)
- scientific article; zbMATH DE number 1818892 (Why is no real title available?)
- scientific article; zbMATH DE number 3790208 (Why is no real title available?)
- scientific article; zbMATH DE number 3534286 (Why is no real title available?)
- scientific article; zbMATH DE number 1821400 (Why is no real title available?)
- scientific article; zbMATH DE number 3365044 (Why is no real title available?)
- A proximal-based deomposition method for compositions method for convex minimization problems
- Alternating Projection-Proximal Methods for Convex Programming and Variational Inequalities
- Applications of a Splitting Algorithm to Decomposition in Convex Programming and Variational Inequalities
- Convex Optimization in Signal Processing and Communications
- Ergodic convergence to a zero of the sum of monotone operators in Hilbert space
- Finite-Dimensional Variational Inequalities and Complementarity Problems
- Interior projection-like methods for monotone variational inequalities
- Monotone Operators and the Proximal Point Algorithm
- On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators
- Prox-Method with Rate of Convergence O(1/t) for Variational Inequalities with Lipschitz Continuous Monotone Operators and Smooth Convex-Concave Saddle Point Problems
- Proximité et dualité dans un espace hilbertien
- Rate of Convergence Analysis of Decomposition Methods Based on the Proximal Method of Multipliers for Convex Minimization
- Smooth minimization of non-smooth functions
- Smoothing and first order methods: a unified framework
- Splitting Algorithms for the Sum of Two Nonlinear Operators
- The direct extension of ADMM for multi-block convex minimization problems is not necessarily convergent
- Variational Analysis
Cited in
(51)- No-regret dynamics in the Fenchel game: a unified framework for algorithmic convex optimization
- Primal-dual proximal splitting and generalized conjugation in non-smooth non-convex optimization
- Convergence Results for Primal-Dual Algorithms in the Presence of Adjoint Mismatch
- New convergence analysis of a primal-dual algorithm with large stepsizes
- Block-wise primal-dual algorithms for large-scale doubly penalized ANOVA modeling
- A nested primal-dual FISTA-like scheme for composite convex optimization problems
- Bregman three-operator splitting methods
- An accelerated minimax algorithm for convex-concave saddle point problems with nonsmooth coupling function
- On starting and stopping criteria for nested primal-dual iterations
- On the information-adaptive variants of the ADMM: an iteration complexity perspective
- A review on the adaptive-ridge algorithm with several extensions
- First-order algorithms for convex optimization with nonseparable objective and coupled constraints
- Nonlinear forward-backward splitting with projection correction
- Asymmetric forward-backward-adjoint splitting for solving monotone inclusions involving three operators
- A primal-dual backward reflected forward splitting algorithm for structured monotone inclusions
- Unified linear convergence of first-order primal-dual algorithms for saddle point problems
- Some extensions of the operator splitting schemes based on Lagrangian and primal–dual: a unified proximal point analysis
- Proximal Splitting Algorithms for Convex Optimization: A Tour of Recent Advances, with New Twists
- Interpolation conditions for linear operators and applications to performance estimation problems
- Semi-proximal point method for nonsmooth convex-concave minimax optimization
- An augmented Lagrangian primal-dual semismooth Newton method for multi-block composite optimization
- On the ergodic convergence rates of a first-order primal-dual algorithm
- On lower iteration complexity bounds for the convex concave saddle point problems
- Convergence of a generalized primal-dual algorithm with an improved condition for saddle point problems
- The operator splitting schemes revisited: primal-dual gap and degeneracy reduction by a unified analysis
- A new primal-dual algorithm for minimizing the sum of three functions with a linear operator
- A symmetric primal-dual method with double extrapolation for composite convex optimization involving three functions
- An accelerated HPE-type algorithm for a class of composite convex-concave saddle-point problems
- An accelerated non-Euclidean hybrid proximal extragradient-type algorithm for convex-concave saddle-point problems
- Easily Parallelizable and Distributable Class of Algorithms for Structured Sparsity, with Optimal Acceleration
- Preconditioned three-operator splitting algorithm with applications to image restoration
- Convergence analysis of the stochastic reflected forward-backward splitting algorithm
- Practical proximal primal-dual algorithms for structured saddle point problems
- Federated primal dual fixed point algorithm
- A generalized forward-backward splitting operator: degenerate analysis and applications
- The mirror-prox sliding method for non-smooth decentralized saddle-point problems
- Improved Pointwise Iteration-Complexity of A Regularized ADMM and of a Regularized Non-Euclidean HPE Framework
- A continuous algorithm for finding the saddle points of convex-concave functions
- Primal-dual fixed point algorithm based on adapted metric method for solving convex minimization problem with application
- Solving saddle point problems: a landscape of primal-dual algorithm with larger stepsizes
- An introduction to continuous optimization for imaging
- A stochastic variance reduction algorithm with Bregman distances for structured composite problems
- Dualize, split, randomize: toward fast nonsmooth optimization algorithms
- An accelerated primal-dual fixed point algorithm for three-block composite optimization problems
- Practical acceleration of the Condat-Vũ algorithm
- A globally linearly convergent method for pointwise quadratically supportable convex-concave saddle point problems
- The Shannon total variation
- Uniqueness of DRS as the 2 operator resolvent-splitting and impossibility of 3 operator resolvent-splitting
- Adaptive proximal algorithms for convex optimization under local Lipschitz continuity of the gradient
- A stochastic primal-dual splitting algorithm with variance reduction for composite optimization problems
- A unified single-loop alternating gradient projection algorithm for nonconvex-concave and convex-nonconcave minimax problems
This page was built for publication: A simple algorithm for a class of nonsmooth convex-concave saddle-point problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1785640)
