Preconditioned iterative methods for a class of nonlinear eigenvalue problems preconditioned iterative
methods: preconditioned simple iteration
method, preconditioned
steepest descent method Positive definiteness of forms: Numerical identification optimization technique, namely, the
steepest descent and the conjugate gradient
methods. The effectiveness
Preconditioned iterative methods for a class of nonlinear eigenvalue problems preconditioned iterative
methods: preconditioned simple iteration
method, preconditioned
steepest descent method Checking the definiteness of forms, such as the
steepest descent method and the conjugate gradient
method. A theoretical analysis and computational
Testing the sign-definiteness of forms optimization: the
steepest descent method and the conjugate gradient
method. Theoretical analysis and a
Descent method for monotone mixed variational inequalities combined regularization and
descent method for initial monotone problems and establish convergence of its
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