Title: A generalized hybrid steepest descent method and applications
| dc.contributor.author | D.R. Sahu | |
| dc.contributor.author | J.C. Yao | |
| dc.date.accessioned | 2026-02-07T08:30:53Z | |
| dc.date.issued | 2017 | |
| dc.description.abstract | The purpose of this paper is to investigate a generalized hybrid steepest descent method and develop a convergence theory for solving monotone variational inequality over the fixed point set of a mapping which is not necessarily Lipschitz continuous. Using this result, we consider the convex minimization problem for a continuously differentiable convex function whose gradient is not necessarily Lipschitzian. © 2017 Journal of Nonlinear and Variational Analysis | |
| dc.identifier.issn | 25606921 | |
| dc.identifier.uri | https://dl.bhu.ac.in/bhuir/handle/123456789/30784 | |
| dc.publisher | Biemdas Academic Publishers | |
| dc.subject | Convex minimization problem | |
| dc.subject | Fixed point | |
| dc.subject | Hybrid steepest descent method | |
| dc.subject | Monotone variational inequality | |
| dc.subject | Nearly asymptotically nonexpansive mapping | |
| dc.title | A generalized hybrid steepest descent method and applications | |
| dc.type | Publication | |
| dspace.entity.type | Article |