Selective Bi-coordinate variations for network equilibrium problems with mixed demand propose a modification of the
method of bi-
coordinate variations for network equilibrium problems
Descent method for monotone mixed variational inequalities combined regularization and
descent method for initial monotone problems and establish convergence of its
Aspects of Applying the Method of Coordinate Descent for the Shepherd Dog Bio-inspired Algorithm is formalized by the Gauss–Seidel
method of
coordinate descent, named similarly to the Gauss–Seidel iterative
Descent method for nonsmooth variational inequalitiesA
descent method with a gap function is proposed for a finite-dimensional variational inequality
On convergence of descent methods for variational inequalities in a Hilbert space and convergence of the corresponding
descent methods under a Hilbert space setting are considered. We give various
A descent method with inexact linear search for nonsmooth equilibrium problemsA
descent method with respect to the gap function is formulated and justified for the nonsmooth
Descent methods for equilibrium problems in a banach space-free
descent method and give conditions which provide strong convergence of the
method. © 2004 Elsevier Ltd. AU
Descent methods for mixed variational inequalities in a Hilbert space descent methods for the above problem under various monotonicity assumptions on the cost mapping.
Selective Bi-coordinate Method for Limit Non-Smooth Resource Allocation Type Problems© 2017, Springer Science+Business Media B.V. We propose a
method of bi-
coordinate variations