scholarly journals Fejér-monotone hybrid steepest descent method for affinely constrained and composite convex minimization tasks

Optimization ◽  
2018 ◽  
Vol 67 (11) ◽  
pp. 1963-2001 ◽  
Author(s):  
Konstantinos Slavakis ◽  
Isao Yamada
2014 ◽  
Vol 2014 ◽  
pp. 1-13
Author(s):  
Jitsupa Deepho ◽  
Poom Kumam

We introduced an implicit and an explicit iteration method based on the hybrid steepest descent method for finding a common element of the set of solutions of a constrained convex minimization problem and the set of solutions of a split variational inclusion problem.


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