A simple algorithm for a class of nonsmooth convex-concave saddle-point problems
type: Item
instance of: scholarly article
title: A simple algorithm for a class of nonsmooth convex-concave saddle-point problems
zbMATH Open document ID: 1408.90234
author: Yoel Drori
author: Shoham Sabach
author: Marc Teboulle
published in: Operations Research Letters
publication date: 2018-10-01T00:00:00Z
Mathematics Subject Classification ID: 90C25
Mathematics Subject Classification ID: 90C60
Mathematics Subject Classification ID: 90C30
zbMATH DE Number: 6945725
zbMATH Keywords: saddle-point problems
zbMATH Keywords: nonsmooth convex minimization
zbMATH Keywords: iteration complexity
MaRDI profile type: Publication
full work available at URL: j.orl.2015.02.001
OpenAlex ID: W2071236014
cites work: Q4779970
cites work: Interior projection-like methods for monotone variational inequalities
cites work: Smoothing and first order methods: a unified framework
cites work: Q3151174
cites work: The direct extension of ADMM for multi-block convex minimization problems is not necessarily convergent
cites work: A proximal-based deomposition method for compositions method for convex minimization problems
cites work: On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators
cites work: Finite-Dimensional Variational Inequalities and Complementarity Problems
cites work: Q3038523
cites work: Q4110807
cites work: Splitting Algorithms for the Sum of Two Nonlinear Operators
cites work: Proximité et dualité dans un espace hilbertien
cites work: Prox-Method with Rate of Convergence O(1/t) for Variational Inequalities with Lipschitz Continuous Monotone Operators and Smooth Convex-Concave Saddle Point Problems
cites work: Q3967358
cites work: Smooth minimization of non-smooth functions
cites work: Convex Optimization in Signal Processing and Communications
cites work: Ergodic convergence to a zero of the sum of monotone operators in Hilbert space
cites work: Q5638112
cites work: Monotone Operators and the Proximal Point Algorithm
cites work: Variational Analysis
cites work: Rate of Convergence Analysis of Decomposition Methods Based on the Proximal Method of Multipliers for Convex Minimization
cites work: Applications of a Splitting Algorithm to Decomposition in Convex Programming and Variational Inequalities
cites work: Alternating Projection-Proximal Methods for Convex Programming and Variational Inequalities
DOI: 10.1016/J.ORL.2015.02.001
Recommended article: Q5695678
Recommended article: An algorithm for a constrained saddle point problem via an exact penalty method
Recommended article: Optimization of one class of nonsymmetrizable algorithms for saddle point problems
Recommended article: On saddle points and optima for non-smooth and non-convex programs
Recommended article: An algorithm for linearly constrained convex nondifferentiable minimization problems
Recommended article: Q3807885
Recommended article: Q4406339
Recommended article: Algorithmic Applications in Management
Recommended article: A continuous algorithm for finding the saddle points of convex-concave functions
Recommended article: A primal-dual algorithm framework for convex saddle-point optimization
description: scientific article; zbMATH DE number 6945725