Open AccessComposite steepest-descent method for the triple hierarchical variational inequalities
Author(s) -
Lu-Chuan Ceng,
JenChih Yao,
Yonghong Yao
Publication year - 2019
Publication title -
filomat
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.449
H-Index - 34
eISSN - 2406-0933
pISSN - 0354-5180
DOI - 10.2298/fil1914403c
Subject(s) - method of steepest descent , mathematics , variational inequality , hilbert space , convergence (economics) , composite number , descent (aeronautics) , gradient descent , space (punctuation) , algorithm , mathematical optimization , mathematical analysis , artificial neural network , computer science , artificial intelligence , aerospace engineering , engineering , economics , economic growth , operating system
In this paper, we introduce and analyze a composite steepest-descent algorithm for solving the triple hierarchical variational inequality problem in a real Hilbert space. Under mild conditions, the strong convergence of the iteration sequences generated by the algorithm is established.