default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDZhen-Ping Yang
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j10]Zhen-Ping Yang, Yong Zhao
:
Hybrid SGD algorithms to solve stochastic composite optimization problems with application in sparse portfolio selection problems. J. Comput. Appl. Math. 436: 115425 (2024)- [j9]Zhen-Ping Yang, Yong Zhao, Gui-Hua Lin:
Variable sample-size optimistic mirror descent algorithm for stochastic mixed variational inequalities. J. Glob. Optim. 89(1): 143-170 (2024) - 2023
- [j8]Gui-Hua Lin, Zhen-Ping Yang, Haian Yin, Jin Zhang:
A dual-based stochastic inexact algorithm for a class of stochastic nonsmooth convex composite problems. Comput. Optim. Appl. 86(2): 669-710 (2023) - [j7]Shuilian Xie, Zhen-Ping Yang, Hongru Xu:
A modulus-based matrix splitting method for the vertical nonlinear complementarity problem. J. Appl. Math. Comput. 69(4): 2987-3003 (2023) - 2022
- [j6]Zhen-Ping Yang, Gui-Hua Lin:
Two fast variance-reduced proximal gradient algorithms for SMVIPs-Stochastic Mixed Variational Inequality Problems with suitable applications to stochastic network games and traffic assignment problems. J. Comput. Appl. Math. 408: 114132 (2022) - 2021
- [j5]Zhen-Ping Yang, Gui-Hua Lin:
Variance-Based Single-Call Proximal Extragradient Algorithms for Stochastic Mixed Variational Inequalities. J. Optim. Theory Appl. 190(2): 393-427 (2021) - [j4]Zhen-Ping Yang, Jin Zhang, Yuliang Wang, Gui-Hua Lin:
Variance-Based Subgradient Extragradient Method for Stochastic Variational Inequality Problems. J. Sci. Comput. 89(1): 4 (2021) - 2020
- [j3]Zhen-Ping Yang, Yuliang Wang, Gui-Hua Lin:
Variance-Based Modified Backward-Forward Algorithm with Line Search for Stochastic Variational Inequality Problems and Its Applications. Asia Pac. J. Oper. Res. 37(3): 2050011:1-2050011:33 (2020)
2010 – 2019
- 2019
- [j2]Zhen-Ping Yang, Jin Zhang, Xide Zhu, Gui-Hua Lin:
Infeasible interior-point algorithms based on sampling average approximations for a class of stochastic complementarity problems and their applications. J. Comput. Appl. Math. 352: 382-400 (2019) - [j1]Xiao-Juan Zhang, Xue-Wu Du, Zhen-Ping Yang, Gui-Hua Lin:
An Infeasible Stochastic Approximation and Projection Algorithm for Stochastic Variational Inequalities. J. Optim. Theory Appl. 183(3): 1053-1076 (2019)
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-05-03 20:45 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:
