default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDZhiyou Wu
Publications
- 2023
[j21]Chuanye Gu, Lin Jiang, Jueyou Li
, Zhiyou Wu:
Privacy-Preserving Dual Stochastic Push-Sum Algorithm for Distributed Constrained Optimization. J. Optim. Theory Appl. 197(1): 22-50 (2023)- 2022
- [j20]Jueyou Li, Chuanye Gu, Zhiyou Wu, Tingwen Huang:
Online Learning Algorithm for Distributed Convex Optimization With Time-Varying Coupled Constraints and Bandit Feedback. IEEE Trans. Cybern. 52(2): 1009-1020 (2022) - 2021
- [j17]Jueyou Li, Xiaomei Zhu, Zhiyou Wu, Tingwen Huang:
Online distributed dual averaging algorithm for multi-agent bandit optimization over time-varying general directed networks. Inf. Sci. 581: 678-693 (2021) - [j16]Linxi Yang, Jiezhi Yang, Mingjie Peng, Jiatian Pi, Zhiyou Wu, Xunyi Zhou, Jueyou Li:
Sparse adversarial attack based on ℓ q-norm for fooling the face anti-spoofing neural networks. J. Electronic Imaging 30(2): 023023 (2021) - 2020
- [j14]Jueyou Li, Chuanye Gu, Zhiyou Wu:
Online distributed stochastic learning algorithm for convex optimization in time-varying directed networks. Neurocomputing 416: 85-94 (2020) - [j13]Chuanye Gu, Zhiyou Wu, Jueyou Li:
Regularized dual gradient distributed method for constrained convex optimization over unbalanced directed graphs. Numer. Algorithms 84(1): 91-115 (2020) - 2019
- [j12]Chuanye Gu, Jueyou Li, Zhiyou Wu:
An adaptive online learning algorithm for distributed convex optimization with coupled constraints over unbalanced directed graphs. J. Frankl. Inst. 356(13): 7548-7570 (2019) - 2018
- [j11]Jueyou Li, Guoquan Li, Zhiyou Wu, Changzhi Wu:
Stochastic mirror descent method for distributed multi-agent optimization. Optim. Lett. 12(6): 1179-1197 (2018) - 2017
- [j10]Jueyou Li, Chuanye Gu, Zhiyou Wu, Changzhi Wu:
Distributed Optimization Methods for Nonconvex Problems with Inequality Constraints over Time-Varying Networks. Complex. 2017: 3610283:1-3610283:10 (2017) - 2016
- [j9]Jueyou Li, Guo Chen, Zhaoyang Dong, Zhiyou Wu:
A fast dual proximal-gradient method for separable convex optimization with linear coupled constraints. Comput. Optim. Appl. 64(3): 671-697 (2016) - [j8]Jueyou Li, Guo Chen, Zhaoyang Dong, Zhiyou Wu, Minghai Yao:
Distributed mirror descent method for saddle point problems over directed graphs. Complex. 21(S2): 178-190 (2016) - [j7]Jueyou Li, Guo Chen, Zhaoyang Dong, Zhiyou Wu:
Distributed mirror descent method for multi-agent optimization with delay. Neurocomputing 177: 643-650 (2016) - [j6]Jueyou Li, Zhiyou Wu, Changzhi Wu, Qiang Long, Xiangyu Wang:
An Inexact Dual Fast Gradient-Projection Method for Separable Convex Optimization with Linear Coupled Constraints. J. Optim. Theory Appl. 168(1): 153-171 (2016) - 2015
- [j4]Jueyou Li, Changzhi Wu, Zhiyou Wu, Qiang Long:
Gradient-free method for nonsmooth distributed optimization. J. Glob. Optim. 61(2): 325-340 (2015) - 2014
- [j2]Jueyou Li, Chaojie Li, Zhiyou Wu, Junjian Huang:
A feedback neural network for solving convex quadratic bi-level programming problems. Neural Comput. Appl. 25(3-4): 603-611 (2014)
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-07-05 21:06 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:
