default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDCheng Lu 0007
Person information
- affiliation: North China Electric Power University, School of Economics and Management, Beijing, China
Other persons with the same name
- Cheng Lu — disambiguation page
- Cheng Lu 0001
![[0000-0002-7651-3924]](https://dblp.uni-trier.de./img/orcid-mark.12x12.png "0000-0002-7651-3924")
— Southern Medical University, Guangzhou, China (and 1 more) - Cheng Lu 0002 — Northwestern Polytechnical University, School of Aeronautics, Xi'an, China
- Cheng Lu 0003 — Nantong University, College of Electrical Engineering, Nantong, China
- Cheng Lu 0004 — Qingdao University of Technology, School of Management Engineering, Qingdao, China
- Cheng Lu 0005 — Southeast University, Key Laboratory of Child Development and Learning Science, Nanjing, China
- Cheng Lu 0006 — XPENG Motors, Guangzhou, China
- Cheng Lu 0008 — China Academy of Chinese Medical Sciences, Institute of Basic Research in Clinical Medicine, Beijing, China
- Cheng Lu 0009 — Micron Technology, Inc., San Jose, CA, USA
- Cheng Lu 0010 — Hohai University, Changzhou, China (and 1 more)
- Cheng Lu 0011 — Tsinghua University, China
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j19]Cheng Lu, Jitao Ma, Zhibin Deng, Wenxun Xing:
A graphic structure based branch-and-bound algorithm for complex quadratic optimization and applications to magnitude least-square problem. J. Glob. Optim. 88(1): 115-137 (2024)- [c10]Bing Han, Zhiqiang Lv, Anbai Jiang, Wen Huang, Zhengyang Chen, Yufeng Deng, Jiawei Ding, Cheng Lu, Wei-Qiang Zhang, Pingyi Fan, Jia Liu, Yanmin Qian:
Exploring Large Scale Pre-Trained Models for Robust Machine Anomalous Sound Detection. ICASSP 2024: 1326-1330 - [c9]Wen Huang, Anbai Jiang, Bing Han, Xinhu Zheng, Yihong Qiu, Wenxi Chen, Yuzhe Liang, Pingyi Fan, Wei-Qiang Zhang, Cheng Lu, Xie Chen, Jia Liu, Yanmin Qian:
Semi-Supervised Acoustic Scene Classification with Test-Time Adaptation. ICME Workshops 2024: 1-5 - [i5]Bing Han, Wen Huang, Zhengyang Chen, Anbai Jiang, Pingyi Fan, Cheng Lu, Zhiqiang Lv, Jia Liu, Wei-Qiang Zhang, Yanmin Qian:
Data-Efficient Low-Complexity Acoustic Scene Classification via Distilling and Progressive Pruning. CoRR abs/2410.20775 (2024) - 2023
- [j18]Shaoze Li, Zhibin Deng, Cheng Lu, Junhao Wu, Jinyu Dai, Qiao Wang:
An efficient global algorithm for indefinite separable quadratic knapsack problems with box constraints. Comput. Optim. Appl. 86(1): 241-273 (2023) - [j17]Yingzhe Xu, Cheng Lu, Zhibin Deng, Ya-Feng Liu:
New semidefinite relaxations for a class of complex quadratic programming problems. J. Glob. Optim. 87(1): 255-275 (2023) - [j16]Cheng Lu, Zhibin Deng, Shu-Cherng Fang, Wenxun Xing:
A New Global Algorithm for Max-Cut Problem with Chordal Sparsity. J. Optim. Theory Appl. 197(2): 608-638 (2023) - [j15]Cheng Lu, Junhao Wu, Zhibin Deng, Shaoze Li:
A fast global algorithm for singly linearly constrained separable binary quadratic program with partially identical parameters. Optim. Lett. 17(3): 613-628 (2023) - [j14]Qiao Wang, Cheng Lu, Zhibin Deng, Jichang Dong:
A simplified completely positive reformulation for binary quadratic programs. Oper. Res. Lett. 51(3): 197-200 (2023) - 2022
- [j13]Cheng Lu, Zhibin Deng, Shu-Cherng Fang, Qingwei Jin, Wenxun Xing:
Fast computation of global solutions to the single-period unit commitment problem. J. Comb. Optim. 44(3): 1511-1536 (2022) - [c8]Yufeng Deng, Anbai Jiang, Yuchen Duan, Jitao Ma, Xuchu Chen, Jia Liu, Pingyi Fan, Cheng Lu, Wei-Qiang Zhang:
Ensemble of Multiple Anomalous Sound Detectors. DCASE 2022 - 2021
- [j12]Cheng Lu, Zhibin Deng:
A branch-and-bound algorithm for solving max-k-cut problem. J. Glob. Optim. 81(2): 367-389 (2021) - 2020
- [j11]Florian Jarre, Felix Lieder, Ya-Feng Liu, Cheng Lu:
Set-completely-positive representations and cuts for the max-cut polytope and the unit modulus lifting. J. Glob. Optim. 76(4): 913-932 (2020) - [j10]Zhibin Deng, Cheng Lu, Ye Tian, Jian Luo:
Globally solving extended trust region subproblems with two intersecting cuts. Optim. Lett. 14(7): 1855-1867 (2020)
2010 – 2019
- 2019
- [j9]Cheng Lu, Zhibin Deng, Jing Zhou, Xiaoling Guo:
A sensitive-eigenvector based global algorithm for quadratically constrained quadratic programming. J. Glob. Optim. 73(2): 371-388 (2019) - [j8]Cheng Lu, Ya-Feng Liu, Wei-Qiang Zhang, Shuzhong Zhang:
Tightness of a New and Enhanced Semidefinite Relaxation for MIMO Detection. SIAM J. Optim. 29(1): 719-742 (2019) - [c7]Ya-Feng Liu, Zi Xu, Cheng Lu:
On the Equivalence of Semidifinite Relaxations for MIMO Detection with General Constellations. ICASSP 2019: 4549-4553 - [i4]Cheng Lu, Ya-Feng Liu, Jing Zhou:
An Enhanced SDR based Global Algorithm for Nonconvex Complex Quadratic Programs with Signal Processing Applications. CoRR abs/1902.04287 (2019) - [i3]Ya-Feng Liu, Zi Xu, Cheng Lu:
On the Equivalence of Semidifinite Relaxations for MIMO Detection with General Constellations. CoRR abs/1902.06381 (2019) - 2018
- [j7]Cheng Lu, Zhibin Deng, Wei-Qiang Zhang, Shu-Cherng Fang:
Argument division based branch-and-bound algorithm for unit-modulus constrained complex quadratic programming. J. Glob. Optim. 70(1): 171-187 (2018) - [j6]Cheng Lu, Zhibin Deng:
DC decomposition based branch-and-bound algorithms for box-constrained quadratic programs. Optim. Lett. 12(5): 985-996 (2018) - 2017
- [j5]Cheng Lu, Zhibin Deng, Qingwei Jin:
An eigenvalue decomposition based branch-and-bound algorithm for nonconvex quadratic programming problems with convex quadratic constraints. J. Glob. Optim. 67(3): 475-493 (2017) - [j4]Cheng Lu, Ya-Feng Liu:
An Efficient Global Algorithm for Single-Group Multicast Beamforming. IEEE Trans. Signal Process. 65(14): 3761-3774 (2017) - [c6]Cheng Lu, Ya-Feng Liu, Jing Zhou:
An efficient global algorithm for nonconvex complex quadratic problems with applications in wireless communications. ICCC 2017: 1-5 - [c5]Ya-Feng Liu, Cheng Lu, Meixia Tao, Jiageng Wu:
Joint multicast and unicast beamforming for the MISO downlink interference channel. SPAWC 2017: 1-5 - [i2]Cheng Lu, Ya-Feng Liu:
An Efficient Global Algorithm for Single-Group Multicast Beamforming. CoRR abs/1702.01974 (2017) - [i1]Cheng Lu, Ya-Feng Liu, Wei-Qiang Zhang, Shuzhong Zhang:
Tightness of a new and enhanced semidefinite relaxation for MIMO detection. CoRR abs/1710.02048 (2017) - 2015
- [j3]Zhibin Deng, Shu-Cherng Fang, Qingwei Jin, Cheng Lu:
Conic approximation to nonconvex quadratic programming with convex quadratic constraints. J. Glob. Optim. 61(3): 459-478 (2015) - [j2]Cheng Lu, Xiaoling Guo:
Convex reformulation for binary quadratic programming problems via average objective value maximization. Optim. Lett. 9(3): 523-535 (2015) - [c4]Meng Cai, Zhiqiang Lv, Cheng Lu, Jian Kang, Like Hui, Zhuo Zhang, Jia Liu:
High-performance Swahili keyword search with very limited language pack: The THUEE system for the OpenKWS15 evaluation. ASRU 2015: 215-222 - [c3]Zhiqiang Lv, Meng Cai, Cheng Lu, Jian Kang, Like Hui, Wei-Qiang Zhang, Jia Liu:
Improved system fusion for keyword search. ASRU 2015: 230-236 - [c2]Meng Cai, Zhiqiang Lv, Beili Song, Yongzhe Shi, Wei-lan Wu, Cheng Lu, Wei-Qiang Zhang, Jia Liu:
The THUEE system for the openKWS14 keyword search evaluation. ICASSP 2015: 4734-4738 - [c1]Jian Kang, Cheng Lu, Meng Cai, Wei-Qiang Zhang, Jia Liu:
Neuron sparseness versus connection sparseness in deep neural network for large vocabulary speech recognition. ICASSP 2015: 4954-4958 - 2011
- [j1]Cheng Lu, Shu-Cherng Fang, Qingwei Jin, Zhenbo Wang, Wenxun Xing:
KKT Solution and Conic Relaxation for Solving Quadratically Constrained Quadratic Programming Problems. SIAM J. Optim. 21(4): 1475-1490 (2011)
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-12-08 02:25 CET 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:
