First-order convergence theory for weakly-convex-weakly-concave min-max problems
In this paper, we consider first-order convergence theory and algorithms for solving a class
of non-convex non-concave min-max saddle-point problems, whose objective function is …
of non-convex non-concave min-max saddle-point problems, whose objective function is …
Stochastic relaxed inertial forward-backward-forward splitting for monotone inclusions in Hilbert spaces
We consider monotone inclusions defined on a Hilbert space where the operator is given by
the sum of a maximal monotone operator T and a single-valued monotone, Lipschitz …
the sum of a maximal monotone operator T and a single-valued monotone, Lipschitz …
An infeasible projection type algorithm for nonmonotone variational inequalities
M Ye - Numerical Algorithms, 2022 - Springer
It is well known that the monotonicity of the underlying mapping of variational inequalities
plays a central role in the convergence analysis. In this paper, we propose an infeasible …
plays a central role in the convergence analysis. In this paper, we propose an infeasible …
Online learning with continuous variations: Dynamic regret and reductions
Online learning is a powerful tool for analyzing iterative algorithms. However, the classic
adversarial setup fails to capture regularity that can exist in practice. Motivated by this …
adversarial setup fails to capture regularity that can exist in practice. Motivated by this …
Beyond monotone variational inequalities: Solution methods and iteration complexities
In this paper, we discuss variational inequality (VI) problems without monotonicity from the
perspective of convergence of projection-type algorithms. In particular, we identify existing …
perspective of convergence of projection-type algorithms. In particular, we identify existing …
A new self-adaptive iterative method for variational inclusion problems on Hadamard manifolds with applications
The objective of this work is to design a new iterative method based on Armijo's type-
modified extragradient method for solving the inclusion problem (A+ B)-1 (0), where A is a …
modified extragradient method for solving the inclusion problem (A+ B)-1 (0), where A is a …
Modified projection methods for solving multi-valued variational inequality without monotonicity
X He, N Huang, X Li - Networks and Spatial Economics, 2019 - Springer
In this paper, we propose two new projection-type algorithms for solving the multi-valued
variational inequality in finite dimensional spaces. We prove the convergence of the …
variational inequality in finite dimensional spaces. We prove the convergence of the …
An extragradient-type algorithm for solving a nonmonotone equilibrium problem over the fixed point set in a Hilbert space
L Deng, R Hu, YP Fang - … in Nonlinear Science and Numerical Simulation, 2024 - Elsevier
We present an extragradient-type algorithm for solving a nonmonotone and non-Lipschitzian
equilibrium problem over the fixed point set of a nonexpansive mapping in a Hilbert space …
equilibrium problem over the fixed point set of a nonexpansive mapping in a Hilbert space …
An algorithm for best generalised rational approximation of continuous functions
In this paper we introduce an algorithm for solving variational inequality problems when the
operator is pseudomonotone and point-to-set (therefore not relying on continuity …
operator is pseudomonotone and point-to-set (therefore not relying on continuity …
A modified Solodov-Svaiter method for solving nonmonotone variational inequality problems
B Van Dinh, HD Manh, TTH Thanh - Numerical Algorithms, 2022 - Springer
In a very interesting paper (SIAM J. Control Optim. 37 (3): 765–776, 1999), Solodov and
Svaiter introduced an effective projection algorithm with linesearch for finding a solution of a …
Svaiter introduced an effective projection algorithm with linesearch for finding a solution of a …