Qingna Li

Dr. Qingna Li

orcid

Research Focus & Metrics

Academic Career Length

14Years (2013-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
14 February 2019 in Computational Optimization and Applications
Verified
Journal Article
Closed access
PDF file
JYJuan Yin
Juan Yin
QLQingna Li
Qingna Li

4 March 2020 in Optimization Methods and Software
Verified
Journal Article
Closed access
YYYinqiao Yan
Yinqiao Yan
QLQingna Li
Qingna Li
Support vector machine (SVM) has proved to be a successful approach for machine learning. Two typical SVM models are the L1-loss model for support vector classification (SVC) and ε-L1-loss model for support vector regression (SVR). Due to the non-smoothness of the L1-loss function in the two models, most of the traditional approaches focus on solving the dual problem. In this paper, we propose an augmented Lagrangian method for the L1-loss model, which is designed to solve the primal problem. By tackling the non-smooth term in the model with Moreau–Yosida regularization and the proximal operator, the subproblem in augmented Lagrangian method reduces to a non-smooth linear system, which can be solved via the quadratically convergent semismooth Newton's method. Moreover, the high computational cost in semismooth Newton's method can be significantly reduced by exploring the sparse structure in the generalized Jacobian. Numerical results on various datasets in LIBLINEAR show that the proposed method is competitive with the most popular solvers in both speed and accuracy.

1 January 2021 in SIAM Journal on Optimization
Verified
Journal Article
Closed access
PZPing-Fan Zhao
Ping-Fan Zhao
QLQingna Li
Qingna Li
WCWei-Kun Chen
Wei-Kun Chen
YLYa-Feng Liu
Ya-Feng Liu
Multiple-input multiple-output (MIMO) detection is a fundamental problem in wireless communications and it is strongly NP-hard in general. Massive MIMO has been recognized as a key technology in fifth generation (5G) and beyond communication networks, which on one hand can significantly improve the communication performance and on the other hand poses new challenges of solving the corresponding optimization problems due to the large problem size. While various efficient algorithms such as semidefinite relaxation (SDR) based approaches have been proposed for solving the small-scale MIMO detection problem, they are not suitable to solve the large-scale MIMO detection problem due to their high computational complexities. In this paper, we propose an efficient quadratic programming (QP) relaxation based algorithm for solving the large-scale MIMO detection problem. In particular, we first reformulate the MIMO detection problem as a sparse QP problem. By dropping the sparse constraint, the resulting relaxation problem shares the same global minimizer with the sparse QP problem. In sharp contrast to the SDRs for the MIMO detection problem, our relaxation does not contain any (positive semidefinite) matrix variable and the numbers of variables and constraints in our relaxation are significantly less than those in the SDRs, which makes it particularly suitable for the large-scale problem. Then we propose a projected Newton based quadratic penalty method to solve the relaxation problem, which is guaranteed to converge to the vector of transmitted signals under reasonable conditions. By extensive numerical experiments, when applied to solve small-scale problems, the proposed algorithm is demonstrated to be competitive with the state-of-the-art approaches in terms of detection accuracy and solution efficiency; when applied to solve large-scale problems, the proposed algorithm achieves better detection performance than a recently proposed generalized power method.

26 August 2022 in Mathematical Methods of Operations Research
Verified
Journal Article
Open access
PDF file
QLQingna Li
Qingna Li
ZLZhen Li
Zhen Li
AZAlain Zemkoho
Alain Zemkoho
Support vector classification (SVC) is a classical and well-performed learning method for classification problems. A regularization parameter, which significantly affects the classification performance, has to be chosen and this is usually done by the cross-validation procedure. In this paper, we reformulate the hyperparameter selection problem for support vector classification as a bilevel optimization problem in which the upper-level problem minimizes the average number of misclassified data points over all the cross-validation folds, and the lower-level problems are the $$l_1$$ l 1 -loss SVC problems, with each one for each fold in T-fold cross-validation. The resulting bilevel optimization model is then converted to a mathematical program with equilibrium constraints (MPEC). To solve this MPEC, we propose a global relaxation cross-validation algorithm (GR–CV) based on the well-know Sholtes-type global relaxation method (GRM). It is proven to converge to a C-stationary point. Moreover, we prove that the MPEC-tailored version of the Mangasarian–Fromovitz constraint qualification (MFCQ), which is a key property to guarantee the convergence of the GRM, automatically holds at each feasible point of this MPEC. Extensive numerical results verify the efficiency of the proposed approach. In particular, compared with other methods, our algorithm enjoys superior generalization performance over almost all the data sets used in this paper.

30 October 2017 in Journal of Global Optimization
Verified
Journal Article
Closed access
PDF file
CCChunfeng Cui
Chunfeng Cui
QLQingna Li
Qingna Li
LQLiqun Qi
Liqun Qi
HYHong Yan
Hong Yan

15 April 2019 in Journal of Global Optimization
Verified
Journal Article
Closed access
PDF file
FZFengzhen Zhai
Fengzhen Zhai
QLQingna Li
Qingna Li