Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDShenglong Zhou 0001
Person information
- affiliation: University of Southampton, Southampton, School of Mathematics, UK
- affiliation (former): Beijing Jiaotong University, Department of Applied Mathematics, China
Other persons with the same name
- Shenglong Zhou 0002
![[0000-0002-2575-8104]](https://dblp.uni-trier.de/img/orcid-mark.12x12.png "0000-0002-2575-8104")
— University of Science and Technology of China, Hefei, China - Shenglong Zhou 0003 — Beijing Jiaotong University, China (and 1 more)
- Shenglong Zhou 0004 — North China Electric Power University, School Of Control And Computer Engineering, Beijing, China
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j18]Xinyu Wei, Biing-Hwang Juang, Ouya Wang, Shenglong Zhou, Geoffrey Ye Li:
Accretionary Learning With Deep Neural Networks With Applications. IEEE Trans. Cogn. Commun. Netw. 10(2): 660-673 (2024)- 2023
- [j17]Jun Sun, Lingchen Kong, Shenglong Zhou:
Gradient projection Newton algorithm for sparse collaborative learning using synthetic and real datasets of applications. J. Comput. Appl. Math. 422: 114872 (2023) - [j16]Shenglong Zhou, Geoffrey Ye Li:
Federated Learning Via Inexact ADMM. IEEE Trans. Pattern Anal. Mach. Intell. 45(8): 9699-9708 (2023) - [j15]Shenglong Zhou, Geoffrey Ye Li:
FedGiA: An Efficient Hybrid Algorithm for Federated Learning. IEEE Trans. Signal Process. 71: 1493-1508 (2023) - [c1]Ouya Wang, Shenglong Zhou, Geoffrey Ye Li:
Few-Shot Learning for New Environment Adaptation. GLOBECOM 2023: 351-356 - [i6]Ouya Wang, Shenglong Zhou, Geoffrey Ye Li:
New Environment Adaptation with Few Shots for OFDM Receiver and mmWave Beamforming. CoRR abs/2310.12343 (2023) - 2022
- [j14]Andreas Fischer, Alain B. Zemkoho, Shenglong Zhou:
Semismooth Newton-type method for bilevel optimization: global convergence and extensive numerical experiments. Optim. Methods Softw. 37(5): 1770-1804 (2022) - [j13]Shenglong Zhou:
Sparse SVM for Sufficient Data Reduction. IEEE Trans. Pattern Anal. Mach. Intell. 44(9): 5560-5571 (2022) - [j12]Huajun Wang, Yuan-Hai Shao, Shenglong Zhou, Ce Zhang, Naihua Xiu:
Support Vector Machine Classifier via $L_{0/1}$L0/1 Soft-Margin Loss. IEEE Trans. Pattern Anal. Mach. Intell. 44(10): 7253-7265 (2022) - [j11]Shenglong Zhou, Ziyan Luo, Naihua Xiu, Geoffrey Ye Li:
Computing One-Bit Compressive Sensing via Double-Sparsity Constrained Optimization. IEEE Trans. Signal Process. 70: 1593-1608 (2022) - [i5]Hui Zhang, Shenglong Zhou, Geoffrey Ye Li, Naihua Xiu:
0/1 Deep Neural Networks via Block Coordinate Descent. CoRR abs/2206.09379 (2022) - [i4]Shenglong Zhou, Geoffrey Ye Li:
Exact Penalty Method for Federated Learning. CoRR abs/2208.11231 (2022) - 2021
- [j10]Alain B. Zemkoho, Shenglong Zhou:
Theoretical and numerical comparison of the Karush-Kuhn-Tucker and value function reformulations in bilevel optimization. Comput. Optim. Appl. 78(2): 625-674 (2021) - [j9]Rui Wang, Naihua Xiu, Shenglong Zhou:
An extended Newton-type algorithm for ℓ2-regularized sparse logistic regression and its efficiency for classifying large-scale datasets. J. Comput. Appl. Math. 397: 113656 (2021) - [j8]Shenglong Zhou, Naihua Xiu, Hou-Duo Qi:
Global and Quadratic Convergence of Newton Hard-Thresholding Pursuit. J. Mach. Learn. Res. 22: 12:1-12:45 (2021) - [j7]Shenglong Zhou, Lili Pan, Naihua Xiu:
Newton method for ℓ0-regularized optimization. Numer. Algorithms 88(4): 1541-1570 (2021) - [j6]Shenglong Zhou, Lili Pan, Naihua Xiu, Hou-Duo Qi:
Quadratic Convergence of Smoothing Newton's Method for 0/1 Loss Optimization. SIAM J. Optim. 31(4): 3184-3211 (2021) - [j5]Shenglong Zhou, Meijuan Shang, Lili Pan, Mu Li:
Newton Hard-Thresholding Pursuit for Sparse Linear Complementarity Problem via A New Merit Function. SIAM J. Sci. Comput. 43(2): A772-A799 (2021) - 2020
- [j4]Xinrong Li, Naihua Xiu, Shenglong Zhou:
Matrix Optimization Over Low-Rank Spectral Sets: Stationary Points and Local and Global Minimizers. J. Optim. Theory Appl. 184(3): 895-930 (2020) - [j3]Shenglong Zhou, Naihua Xiu, Hou-Duo Qi:
Robust Euclidean embedding via EDM optimization. Math. Program. Comput. 12(3): 337-387 (2020)
2010 – 2019
- 2019
- [i3]Huajun Wang, Yuan-Hai Shao, Shenglong Zhou, Ce Zhang, Naihua Xiu:
Support Vector Machine Classifier via L0/1 Soft-Margin Loss. CoRR abs/1912.07418 (2019) - 2018
- [j2]Shenglong Zhou, Naihua Xiu, Hou-Duo Qi:
A Fast Matrix Majorization-Projection Method for Penalized Stress Minimization With Box Constraints. IEEE Trans. Signal Process. 66(16): 4331-4346 (2018) - 2015
- [j1]Meijuan Shang, Chao Zhang, Dingtao Peng, Shenglong Zhou:
A half thresholding projection algorithm for sparse solutions of LCPs. Optim. Lett. 9(6): 1231-1245 (2015) - 2013
- [i2]Shenglong Zhou, Lingchen Kong, Ziyan Luo, Naihua Xiu:
New RIC Bounds via l_q-minimization with 0<q<=1 in Compressed Sensing. CoRR abs/1308.0455 (2013) - [i1]Shenglong Zhou, Naihua Xiu, Yingnan Wang, Lingchen Kong:
Exact Recovery for Sparse Signal via Weighted l_1 Minimization. CoRR abs/1312.2358 (2013)
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-08 23:47 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:
