default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDZhensheng Yu
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j15]Luchao Zhang
, Xiping Liu, Mei Jia, Zhensheng Yu:
Piecewise conformable fractional impulsive differential system with delay: existence, uniqueness and Ulam stability. J. Appl. Math. Comput. 70(2): 1543-1570 (2024)- [j14]Zhensheng Yu, Yue Yuan, Panjie Tian:
An efficient trust region algorithm with bounded iteration sequence for unconstrained optimization and its application in support vector machine. J. Comput. Appl. Math. 449: 115956 (2024) - [j13]Yuru Hu, Wangyan Li, Lifeng Wu, Zhensheng Yu:
An attack-resilient distributed extended Kalman consensus filtering algorithm with applications to multi-UAV tracking problems. Frontiers Inf. Technol. Electron. Eng. 25(8): 1110-1122 (2024) - 2023
- [j12]Zhensheng Yu, Xuyu Chen, Xudong Li:
A dynamic programming approach for generalized nearly isotonic optimization. Math. Program. Comput. 15(1): 195-225 (2023) - 2022
- [j11]Wen Zhong, Changxiang He, Chen Xiao, Yuru Liu, Xiaofei Qin, Zhensheng Yu:
Long-distance dependency combined multi-hop graph neural networks for protein-protein interactions prediction. BMC Bioinform. 23(1): 521 (2022) - [j10]Wenjuan Xue, Chungen Shen, Zhensheng Yu:
Limited Memory BFGS Method for Least Squares Semidefinite Programming with Banded Structure. J. Syst. Sci. Complex. 35(4): 1500-1519 (2022) - 2021
- [j9]Zhensheng Yu, Lin Li, Yue Yuan:
A modified multivariate spectral gradient algorithm for solving absolute value equations. Appl. Math. Lett. 121: 107461 (2021) - [j8]Zhensheng Yu, Peixin Li:
A trust region method with project step for bound constrained optimization without compact condition. Int. J. Comput. Math. 98(3): 449-460 (2021) - 2020
- [j7]Changxiang He, Weilong Liu, Baofeng Wu, Zhensheng Yu, Min Chang:
Minimum fundamental cycle basis of some bipartite graphs. AKCE Int. J. Graphs Comb. 17(1): 587-591 (2020)
2010 – 2019
- 2011
- [j6]Zhensheng Yu, Jing Sun, Yi Qin:
A multivariate spectral projected gradient method for bound constrained optimization. J. Comput. Appl. Math. 235(8): 2263-2269 (2011) - [j5]Zhensheng Yu, Anqi Wang:
Global Convergence of a Nonmonotone Trust Region Algorithm with Memory for Unconstrained Optimization. J. Math. Model. Algorithms 10(2): 109-118 (2011)
2000 – 2009
- 2009
- [j4]Zhensheng Yu, Ji Lin:
General Form of Nonmonotone Line Search Techniques For Unconstrained Optimization. Algorithmic Oper. Res. 4(1): 70-75 (2009) - [j3]Ke Su, Zhensheng Yu:
A modified SQP method with nonmonotone technique and its global convergence. Comput. Math. Appl. 57(2): 240-247 (2009) - 2007
- [j2]Zhensheng Yu, Weiguo Zhang, Baofeng Wu:
Strong global convergence of an adaptive nonmonotone memory gradient method. Appl. Math. Comput. 185(1): 681-688 (2007) - 2004
- [j1]Zhensheng Yu:
The bounded smooth reformulation and a trust region algorithm for semidefinite complementarity problems. Appl. Math. Comput. 159(1): 157-170 (2004)
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 2024-10-04 19:55 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 and maintained by:
the dblp computer science bibliography is funded and supported by:
