An alternating extragradient method with non Euclidean projections for saddle point problems
type: Item
instance of: scholarly article
title: An alternating extragradient method with non Euclidean projections for saddle point problems
zbMATH Open document ID: 1326.90103
author: S. Bonettini
author: V. Ruggiero
published in: Computational Optimization and Applications
publication date: 2014-12-12T00:00:00Z
Mathematics Subject Classification ID: 90C47
zbMATH DE Number: 6379668
zbMATH Keywords: alternating extragradient method
zbMATH Keywords: smooth saddle point problem
zbMATH Keywords: interior projection algorithm
zbMATH Keywords: non Euclidean distances
MaRDI profile type: Publication
full work available at URL: s10589-014-9650-3
OpenAlex ID: W2060830293
cites work: An alternating extragradient method for total variation-based image restoration from Poisson data
cites work: Q4110807
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: Interior projection-like methods for monotone variational inequalities
cites work: Projected subgradient methods with non-Euclidean distances for non-differentiable convex minimization and variational inequalities
cites work: A first-order primal-dual algorithm for convex problems with applications to imaging
cites work: Smooth minimization of non-smooth functions
cites work: Nonlinear programming and variational inequality problems. A unified approach
cites work: Convex Analysis
cites work: Modification of the extra-gradient method for solving variational inequalities and certain optimization problems
cites work: Application Of Khobotov’s Algorithm To Variational Inequalities And Network Equilibrium Problems
cites work: New algorithms for singly linearly constrained quadratic programs subject to lower and upper bounds
cites work: Feedback-controlled saddle gradient processes
cites work: An interior point method with Bregman functions for the variational inequality problem with paramonotone operators
cites work: Q3266142
cites work: On the convergence of primal-dual hybrid gradient algorithms for total variation image restoration
cites work: Convergence Analysis of a Proximal-Like Minimization Algorithm Using Bregman Functions
cites work: Mirror descent and nonlinear projected subgradient methods for convex optimization.
cites work: Efficient gradient projection methods for edge-preserving removal of Poisson noise
DOI: 10.1007/S10589-014-9650-3
description: scientific article; zbMATH DE number 6379668