Accelerating the hybrid steepest descent method for affinely constrained convex composite minimization tasks

Author(s):  
Konstantinos Slavakis ◽  
Isao Yamada ◽  
Shunsuke Ono
2012 ◽  
Vol 2012 ◽  
pp. 1-19 ◽  
Author(s):  
L.-C. Ceng ◽  
Q. H. Ansari ◽  
C.-F. Wen

We consider a triple hierarchical variational inequality problem (in short, THVIP). By combining hybrid steepest descent method, viscosity method, and projection method, we propose an approximation method to compute the approximate solution of THVIP. We also study the strong convergence of the sequences generated by the proposed method to a solution of THVIP.


Sign in / Sign up

Export Citation Format

Share Document