Complexity of Variants of Tseng's Modified F-B Splitting and Korpelevich's Methods for Hemivariational Inequalities with Applications to Saddle-point and Convex Optimization Problems

Authors:
Renato D. C. Monteiro;B. F. Svaiter
Affiliations:
monteiro@isye.gatech.edu;benar@impa.br
Venue:
SIAM Journal on Optimization
Year:
2011

Citing 7
Cited 1

On linear convergence of iterative methods for the variational inequality problem

Proceedings of the international meeting on Linear/nonlinear iterative methods and verification of solution
A Modified Forward-Backward Splitting Method for Maximal Monotone Mappings

SIAM Journal on Control and Optimization
An Inexact Hybrid Generalized Proximal Point Algorithm and Some New Results on the Theory of Bregman Functions

Mathematics of Operations Research
Prox-Method with Rate of Convergence O(1/t) for Variational Inequalities with Lipschitz Continuous Monotone Operators and Smooth Convex-Concave Saddle Point Problems

SIAM Journal on Optimization
Dual extrapolation and its applications to solving variational inequalities and related problems

Mathematical Programming: Series A and B
On the Complexity of the Hybrid Proximal Extragradient Method for the Iterates and the Ergodic Mean

SIAM Journal on Optimization
An extraresolvent method for monotone mixed variational inequalities

Mathematical and Computer Modelling: An International Journal

Implementation of a block-decomposition algorithm for solving large-scale conic semidefinite programming problems

Computational Optimization and Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we consider both a variant of Tseng's modified forward-backward splitting method and an extension of Korpelevich's method for solving hemivariational inequalities with Lipschitz continuous operators. By showing that these methods are special cases of the hybrid proximal extragradient method introduced by Solodov and Svaiter, we derive iteration-complexity bounds for them to obtain different types of approximate solutions. In the context of saddle-point problems, we also derive complexity bounds for these methods to obtain another type of an approximate solution, namely, that of an approximate saddle point. Finally, we illustrate the usefulness of the above results by applying them to a large class of linearly constrained convex programming problems, including, for example, cone programming and problems whose objective functions converge to infinity as the boundaries of their effective domains are approached.