default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDaya Ram Sahu
Person information
- affiliation: Banaras Hindu University, Department of Mathematics, Varanasi, India
Other persons with the same name
- D. R. Sahu 0002 — National Cheng Kung University, Department of Materials Science and Engineering, Tainan, Taiwan
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
2020 – today
- 2026
[j34]Ajay Kumar, Balwant Singh Thakur, D. R. Sahu, Jen-Chih Yao, Xiaopeng Zhao
:
Self-adaptive Iterative Proximal Method for Split Minimization Problems with Applications to Image and Signal Processing. Comput. Appl. Math. 45(8): 345 (2026)- [j33]Daya Ram Sahu, S. Huang, Q. L. Dong, X. Qin, J. C. Yao:
Two β-reflected iterative techniques for SFPMOS with applications to signal and image recovery problems. J. Comput. Appl. Math. 488: 117846 (2026) - [j32]Siyuan Huang, Cuijie Zhang, Qiao-Li Dong, D. R. Sahu:
Adaptive Primal-Dual Algorithms for Generic Saddle Point Problems. J. Optim. Theory Appl. 209(3): 81 (2026) - 2025
- [j31]D. R. Sahu, Nitish Kumar Singh:
Robust tracking of discrete-time linear switched systems with disturbance via second-order ILC with data loss. J. Control. Decis. 12(6): 1144-1155 (2025) - [j30]Daya Ram Sahu, Shikher Sharma:
A derivative free projection method for the singularities of vector fields with convex constraints on Hadamard manifolds. Optim. Methods Softw. 40(2): 266-286 (2025) - 2024
- [j29]Daya Ram Sahu, Ariana Pitea, Shikher Sharma, Amit Kumar Singh:
Applications of a variable anchoring iterative method to equation and inclusion problems on Hadamard manifolds. Commun. Nonlinear Sci. Numer. Simul. 138: 108192 (2024) - [j28]D. R. Sahu, Nitish Kumar Singh:
p-Accelerated normal S-iterative learning control algorithm for linear discrete singular time-delay systems. Int. J. Gen. Syst. 53(1): 16-40 (2024) - 2023
- [j27]Daya Ram Sahu, Babu Feeroz, Sharma Shikher:
A new self-adaptive iterative method for variational inclusion problems on Hadamard manifolds with applications. Numer. Algorithms 94(3): 1435-1460 (2023) - [j26]Daya Ram Sahu:
A unified framework for three accelerated extragradient methods and further acceleration for variational inequality problems. Soft Comput. 27(21): 15649-15674 (2023) - 2022
- [j25]Avinash Dixit, Daya Ram Sahu, Pankaj Gautam, Tanmoy Som:
Convergence analysis of two-step inertial Douglas-Rachford algorithm and application. J. Appl. Math. Comput. 68(2): 953-977 (2022) - 2021
- [j24]Daya Ram Sahu, Amit Kumar Singh:
Inertial iterative algorithms for common solution of variational inequality and system of variational inequalities problems. J. Appl. Math. Comput. 65(1-2): 351-378 (2021) - [j23]Pankaj Gautam, Daya Ram Sahu, Avinash Dixit, Tanmoy Som:
Forward-Backward-Half Forward Dynamical Systems for Monotone Inclusion Problems with Application to v-GNE. J. Optim. Theory Appl. 190(2): 491-523 (2021) - [j22]Daya Ram Sahu, Ajeet Kumar, Shin Min Kang:
Proximal point algorithms based on S-iterative technique for nearly asymptotically quasi-nonexpansive mappings and applications. Numer. Algorithms 86(4): 1561-1590 (2021) - [j21]Daya Ram Sahu, Yeol Je Cho, Qiao-Li Dong, M. R. Kashyap, X. H. Li:
Inertial relaxed CQ algorithms for solving a split feasibility problem in Hilbert spaces. Numer. Algorithms 87(3): 1075-1095 (2021) - [j20]Daya Ram Sahu, Amit Kumar Singh:
Inertial normal S-type Tseng's extragradient algorithm for solution of variational inequality problems. RAIRO Oper. Res. 55(4): 2165-2180 (2021) - 2020
- [j19]Pankaj Gautam, Avinash Dixit, Daya Ram Sahu, Tanmoy Som:
Application of new strongly convergent iterative methods to split equality problems. Comput. Appl. Math. 39(3) (2020) - [j18]Daya Ram Sahu, Ariana Pitea, Mridula Verma:
A new iteration technique for nonlinear operators as concerns convex programming and feasibility problems. Numer. Algorithms 83(2): 421-449 (2020) - [j17]Avinash Dixit, Daya Ram Sahu, Amit Kumar Singh, Tanmoy Som:
Application of a new accelerated algorithm to regression problems. Soft Comput. 24(2): 1539-1552 (2020) - [j16]Daya Ram Sahu:
Applications of accelerated computational methods for quasi-nonexpansive operators to optimization problems. Soft Comput. 24(23): 17887-17911 (2020)
2010 – 2019
- 2018
- [j15]Mridula Verma, Daya Ram Sahu, Kaushal Kumar Shukla:
VAGA: a novel viscosity-based accelerated gradient algorithm - Convergence analysis and applications. Appl. Intell. 48(9): 2613-2627 (2018) - 2017
- [j14]Daya Ram Sahu, Jen-Chih Yao, Vipin Kumar Singh, Satyendra Kumar:
Semilocal Convergence Analysis of S-iteration Process of Newton-Kantorovich Like in Banach Spaces. J. Optim. Theory Appl. 172(1): 102-127 (2017) - 2015
- [j13]Giuseppe Marino, Filomena Cianciaruso, Claudio Morales, Luigi Muglia, Daya Ram Sahu:
Iterative Methods and Applications 2014. J. Appl. Math. 2015: 207976:1-207976:2 (2015) - [j12]Daya Ram Sahu, Y. J. Cho, Ravi P. Agarwal, Ioannis K. Argyros:
Accessibility of solutions of operator equations by Newton-like methods. J. Complex. 31(4): 637-657 (2015) - 2014
- [j11]Giuseppe Marino, Filomena Cianciaruso, Luigi Muglia, Claudio Morales, Daya Ram Sahu:
Iterative Methods and Applications. J. Appl. Math. 2014: 827064:1-827064:2 (2014) - [j10]Daya Ram Sahu, Krishna Kumar Singh, Vipin Kumar Singh:
A Newton-like method for generalized operator equations in Banach spaces. Numer. Algorithms 67(2): 289-303 (2014) - 2013
- [j9]Daya Ram Sahu, Qamrul Hasan Ansari, Jen-Chih Yao:
A unified hybrid iterative method for hierarchical minimization problems. J. Comput. Appl. Math. 253: 208-221 (2013) - [j8]Daya Ram Sahu, Vittorio Colao, Giuseppe Marino:
Strong convergence theorems for approximating common fixed points of families of nonexpansive mappings and applications. J. Glob. Optim. 56(4): 1631-1651 (2013) - 2012
- [j7]Daya Ram Sahu, Zeqing Liu, Shin Min Kang:
Existence and approximation of fixed points of nonlinear mappings in spaces with weak uniform normal structure. Comput. Math. Appl. 64(4): 672-685 (2012) - [j6]Daya Ram Sahu, Shin Min Kang, Vidya Sagar:
Approximation of Common Fixed Points of a Sequence of Nearly Nonexpansive Mappings and Solutions of Variational Inequality Problems. J. Appl. Math. 2012: 902437:1-902437:12 (2012) - [j5]Mujahid Abbas, Zoran Kadelburg, Daya Ram Sahu:
Fixed point theorems for Lipschitzian type mappings in CAT(0) spaces. Math. Comput. Model. 55(3-4): 1418-1427 (2012) - [j4]Daya Ram Sahu, Ngai-Ching Wong, Jen-Chih Yao:
A Unified Hybrid Iterative Method for Solving Variational Inequalities Involving Generalized Pseudocontractive Mappings. SIAM J. Control. Optim. 50(4): 2335-2354 (2012) - 2011
- [j3]Daya Ram Sahu, Jen-Chih Yao:
The prox-Tikhonov regularization method for the proximal point algorithm in Banach spaces. J. Glob. Optim. 51(4): 641-655 (2011) - 2010
- [j2]Lu-Chuan Ceng, Daya Ram Sahu, Jen-Chih Yao:
Implicit iterative algorithms for asymptotically nonexpansive mappings in the intermediate sense and Lipschitz-continuous monotone mappings. J. Comput. Appl. Math. 233(11): 2902-2915 (2010)
2000 – 2009
- 2002
- [j1]B. K. Sharma, Daya Ram Sahu, M. Bounias:
Common fixed point theorems for a mixed family of fuzzy and crisp mappings. Fuzzy Sets Syst. 125(2): 261-268 (2002)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2026-07-20 01:32 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated, funded, and maintained by:
Schloss Dagstuhl - Leibniz Center for Informatics is a member of the Leibniz Association and is funded by the federal government of Germany and the states of Germany, especially Saarland and Rhineland‑Palatinate.
