Fetching the paper…
Reading the bibliography…
In this paper, we study a class of generalized monotone variational inequality (GMVI) problems whose operators are not necessarily monotone (e.g., pseudo-monotone).
The relaxation method of finding the common point convex sets and its application to the solution of problems in convex programming
L.M. Bregman · 1967
Earlier work this paper cites.
Méthodes itératives pour les équations et inéquations aux dérivées partielles nonlinéares de type monotone
M. Sibony · 1970
Earlier work this paper cites.
The extragradient method for finding saddle points and other problems
G. Korpelevich · 1976
Earlier work this paper cites.
Solving the nonlinear complementarity problem by a homotopy method
L. T. Watson · 1979
Earlier work this paper cites.
The gap function of a convex program
D.W. Hearn · 1982
Earlier work this paper cites.
Problem complexity and method efficiency in optimization
A. S. Nemirovski and D. Yudin · 1983
Earlier work this paper cites.
Two-metric projection methods for constrained optimization
E. M. Gafni and D. P. Bertsekas · 1984
Earlier work this paper cites.
A damped-Newton method for the linear complementarity problem
P. T. Harker and J. Pang · 1990
Earlier work this paper cites.
Finite-dimensional variational inequality and complementarity problems: a survey of theory, algorithms, and applications
P. T. Harker and J. S. Pang · 1990
Earlier work this paper cites.
Ne/sqp: A robust algorithm for the nonlinear complementarity problem
J. Pang and S. A. Gabriel · 1993
Earlier work this paper cites.
A new step-size skill for solving a class of nonlinear projection equations
D. Sun · 1995
Earlier work this paper cites.
Proximal minimization methods with generalized bregman functions
K.C. Kiwiel · 1997
Cited alongside, same era.
Convergence of proximal-like algorithms
M. Teboulle · 1997
Cited alongside, same era.
Nonlinear Programming
D. Bertsekas · 1999
Cited alongside, same era.
A hybrid approximate extragradient-proximal point algorithm using the enlargement of a maximal monotone operator
M. V. Solodov and B. F. Svaiter · 1999
Cited alongside, same era.
A new projection method for variational inequality problems
M. V. Solodov and B. F. Svaiter · 1999
Cited alongside, same era.
Lectures on Modern Convex Optimization: Analysis, Algorithms, Engineering Applications
A. Ben-Tal and A. S. Nemirovski · 2000
Cited alongside, same era.
Prox-method with rate of convergence o ( 1 / t ) o(1/t) for variational inequalities with lipschitz continuous monotone operators and smooth convex-concave saddle point problems
A. S. Nemirovski · 2005
Later among the works it cites.
Interior gradient and proximal methods for convex and conic optimization
A. Auslender and M. Teboulle · 2006
Later among the works it cites.
Dual extrapolation and its applications to solving variational inequalities and related problems
Y. E. Nesterov · 2007
Later among the works it cites.
Iteration-complexity of first-order penalty methods for convex programming
G. Lan and R. D. C. Monteiro · 2008
Later among the works it cites.
On the complexity of the hybrid proximal extragradient method for the iterates and the ergodic mean
R.D.C. Monteiro and B.F. Svaiter · 2009
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
A modified forward-backward splitting method for maximal monotone mappings
P. Tseng · 2000
Cited alongside, same era.
Bregman monotone optimization algorithms
H.H. Bauschke, J.M. Borwein, and P.L. Combettes · 2003
Cited alongside, same era.
Finite-Dimensional Variational Inequalities and Complementarity Problems, Volumes I and II
F. Facchinei and J. Pang · 2003
Cited alongside, same era.
Introductory Lectures on Convex Optimization: a basic course
Y. E. Nesterov · 2004
Cited alongside, same era.
Interior projection-like methods for monotone variational inequalities
A. Auslender and M. Teboulle · 2005
Cited alongside, same era.
Robust stochastic approximation approach to stochastic programming
A. S. Nemirovski, A. Juditsky, G. Lan, and A. Shapiro · 2009
Later among the works it cites.
Complexity of variants of tseng�s modified f-b splitting and korpelevich’s methods for hemi-variational inequalities with applications to saddle-point and convex optimization problems
R.D.C. Monteiro and B.F. Svaiter · 2010
Later among the works it cites.
Multiuser optimization: Distributed algorithms and error analysis
A. Nedich J. Koshal and U. V. Shanbhag · 2011
Later among the works it cites.
Primal-dual first-order methods with 𝒪 ( 1 / ϵ ) {\cal O}(1/\epsilon) iteration-complexity for cone programming
G. Lan, Z. Lu, and R. D. C. Monteiro · 2011
Later among the works it cites.
An optimal method for stochastic composite optimization
G. Lan · 2012
Later among the works it cites.
Iteration-complexity of first-order augmented lagrangian methods for convex programming
G. Lan and R. D. C. Monteiro · 2013
Closest in time.