An alternating extragradient method with non Euclidean projections for saddle point problems

DOI10.1007/s10589-014-9650-3zbMath1326.90103OpenAlexW2060830293MaRDI QIDQ480931

Valeria Ruggiero, Silvia Bonettini

Publication date: 12 December 2014

Published in: Computational Optimization and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10589-014-9650-3

zbMATH Keywords

alternating extragradient methodinterior projection algorithmnon Euclidean distancessmooth saddle point problem

Mathematics Subject Classification ID

Minimax problems in mathematical programming (90C47)

Cites Work

• Unnamed Item
• Unnamed Item
• Smooth minimization of non-smooth functions
• Projected subgradient methods with non-Euclidean distances for non-differentiable convex minimization and variational inequalities
• Nonlinear programming and variational inequality problems. A unified approach
• An interior point method with Bregman functions for the variational inequality problem with paramonotone operators
• Mirror descent and nonlinear projected subgradient methods for convex optimization.
• Feedback-controlled saddle gradient processes
• A first-order primal-dual algorithm for convex problems with applications to imaging
• On the convergence of primal-dual hybrid gradient algorithms for total variation image restoration
• New algorithms for singly linearly constrained quadratic programs subject to lower and upper bounds
• Interior projection-like methods for monotone variational inequalities
• Convergence Analysis of a Proximal-Like Minimization Algorithm Using Bregman Functions
• Application Of Khobotov’s Algorithm To Variational Inequalities And Network Equilibrium Problems
• An alternating extragradient method for total variation-based image restoration from Poisson data
• Efficient gradient projection methods for edge-preserving removal of Poisson noise
• Modification of the extra-gradient method for solving variational inequalities and certain optimization problems
• Prox-Method with Rate of Convergence O(1/t) for Variational Inequalities with Lipschitz Continuous Monotone Operators and Smooth Convex-Concave Saddle Point Problems
• Convex Analysis

This page was built for publication: An alternating extragradient method with non Euclidean projections for saddle point problems