default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDQingna Li
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j17]He Shi, Qingna Li
:
A facial reduction approach for the single source localization problem. J. Glob. Optim. 87(2): 831-855 (2023)- [j16]Si-Tong Lu, Qingna Li:
A majorization penalty method for SVM with sparse constraint. Optim. Methods Softw. 38(3): 474-494 (2023) - [c3]Xiaoning Bai, Yuge Ye, Qingna Li:
An Adaptive Sieving Strategy for the Complex Lasso Problem. DSIT 2023: 67-72 - 2022
- [j15]Qing-Na Li, Chi Zhang, Mengzhi Cao:
An Ordinal Weighted EDM Model for Nonmetric Multidimensional Scaling. Asia Pac. J. Oper. Res. 39(3): 2150033:1-2150033:22 (2022) - [j14]Qingna Li, Zhen Li, Alain B. Zemkoho:
Bilevel hyperparameter optimization for support vector classification: theoretical analysis and a solution method. Math. Methods Oper. Res. 96(3): 315-350 (2022) - [c2]Zhen Li, Yaru Qian, Qingna Li:
A Unified Framework and a Case Study for Hyperparameter Selection in Machine Learning via Bilevel Optimization. DSIT 2022: 1-8 - [c1]Wen Su, Qingna Li:
An Efficient Method for Sample Adversarial Perturbations against Nonlinear Support Vector Machines. DSIT 2022: 1-8 - [i6]Wen Su, Qingna Li, Chunfeng Cui:
Optimization Models and Interpretations for Three Types of Adversarial Perturbations against Support Vector Machines. CoRR abs/2204.03154 (2022) - [i5]Wen Su, Qingna Li:
An Efficient Method for Sample Adversarial Perturbations against Nonlinear Support Vector Machines. CoRR abs/2206.05664 (2022) - 2021
- [j13]Ping-Fan Zhao, Qingna Li, Wei-Kun Chen, Ya-Feng Liu:
An Efficient Quadratic Programming Relaxation Based Algorithm for Large-Scale MIMO Detection. SIAM J. Optim. 31(2): 1519-1545 (2021) - [i4]Zhao-Wei Wang, Xiao-Wen Liu, Qing-Na Li:
A Euclidean Distance Matrix Model for Convex Clustering. CoRR abs/2105.04947 (2021) - 2020
- [j12]Si-Tong Lu, Miao Zhang, Qing-Na Li:
Feasibility and a fast algorithm for Euclidean distance matrix optimization with ordinal constraints. Comput. Optim. Appl. 76(2): 535-569 (2020) - [j11]Fengzhen Zhai, Qingna Li:
A Euclidean distance matrix model for protein molecular conformation. J. Glob. Optim. 76(4): 709-728 (2020) - [j10]Yinqiao Yan, Qingna Li:
An efficient augmented Lagrangian method for support vector machine. Optim. Methods Softw. 35(4): 855-883 (2020) - [i3]Ping-Fan Zhao, Qing-Na Li, Wei-Kun Chen, Ya-Feng Liu:
An Efficient Quadratic Programming Relaxation Based Algorithm for Large-Scale MIMO Detection. CoRR abs/2006.12123 (2020) - [i2]Chen Jiang, Qingna Li:
A Semismooth-Newton's-Method-Based Linearization and Approximation Approach for Kernel Support Vector Machines. CoRR abs/2007.11954 (2020)
2010 – 2019
- 2019
- [j9]Juan Yin, Qingna Li:
A semismooth Newton method for support vector classification and regression. Comput. Optim. Appl. 73(2): 477-508 (2019) - [i1]Panpan Yu, Qingna Li:
Ordinal Distance Metric Learning with MDS for Image Ranking. CoRR abs/1902.10284 (2019) - 2018
- [j8]Panpan Yu, Qingna Li:
Ordinal Distance Metric Learning with MDS for Image Ranking. Asia Pac. J. Oper. Res. 35(1): 1850007:1-1850007:19 (2018) - [j7]Chunfeng Cui, Qingna Li, Liqun Qi, Hong Yan:
A quadratic penalty method for hypergraph matching. J. Glob. Optim. 70(1): 237-259 (2018) - 2017
- [j6]Qingna Li, Li He, Lijuan Qi, Robert Wang:
Unique Decomposition and a New Model for the Ground Moving Target Indication Problem. J. Optim. Theory Appl. 173(1): 297-312 (2017) - 2011
- [j5]Qingna Li, Houduo Qi, Naihua Xiu:
Block relaxation and majorization methods for the nearest correlation matrix with factor structure. Comput. Optim. Appl. 50(2): 327-349 (2011) - [j4]Qingna Li, Donghui Li:
A projected semismooth Newton method for problems of calibrating least squares covariance matrix. Oper. Res. Lett. 39(2): 103-108 (2011) - [j3]Qingna Li, Houduo Qi:
A Sequential Semismooth Newton Method for the Nearest Low-rank Correlation Matrix Problem. SIAM J. Optim. 21(4): 1641-1666 (2011) - 2010
- [j2]Qingna Li, Donghui Li, Houduo Qi:
Newton's Method for Computing the Nearest Correlation Matrix with a Simple Upper Bound. J. Optim. Theory Appl. 147(3): 546-568 (2010)
2000 – 2009
- 2008
- [j1]Dong-Hui Li, Yi-Yong Nie, Jin-Ping Zeng, Qing-Na Li:
Conjugate gradient method for the linear complementarity problem with S-matrix. Math. Comput. Model. 48(5-6): 918-928 (2008)
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-08-05 20:24 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:
