Rui Wang

Rui Wang

Auto-generated profile, based on publicly available information

Rui Wang

School of Mathematics, Southwestern University of Finance and Economics, Chengdu, Sichuan, China

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
11 April 2019 in IEEE Transactions on Neural Networks and Learning Systems
Verified
Journal Article
Closed access
RWRui Wang
Rui Wang
NXNaihua Xiu
Naihua Xiu
CZChao Zhang
Chao Zhang
Sparse logistic regression (SLR), which is widely used for classification and feature selection in many fields, such as neural networks, deep learning, and bioinformatics, is the classical logistic regression model with sparsity constraints. In this paper, we perform theoretical analysis on the existence and uniqueness of the solution to the SLR, and we propose a greedy projected gradient-Newton (GPGN) method for solving the SLR. The GPGN method is a combination of the projected gradient method and the Newton method. The following characteristics show that the GPGN method achieves not only elegant theoretical results but also a remarkable numerical performance in solving the SLR: 1) the full iterative sequence generated by the GPGN method converges to a global/local minimizer of the SLR under weaker conditions; 2) the GPGN method has the properties of afinite identification for an optimal support set and local quadratic convergence; and 3) the GPGN method achieves higher accuracy and higher speed compared with a number of state-of-the-art solvers according to numerical experiments.

1 January 2022 in Neurocomputing
Verified
Journal Article
Closed access
PZPenghe Zhang
Penghe Zhang
RWRui Wang
Rui Wang
NXNaihua Xiu
Naihua Xiu

1 October 2013 in Computer Graphics Forum
Verified
Journal Article
Closed access
PDF file
YZYahan Zhou
Yahan Zhou
ZLZhaoliang Lun
Zhaoliang Lun
EKEvangelos Kalogerakis
Evangelos Kalogerakis
RWRui Wang
Rui Wang

19 June 2024 in IEEE Transactions on Pattern Analysis and Machine Intelligence
Verified
Journal Article
Closed access
RWRui Wang
Rui Wang
CZChuwen Zhang
Chuwen Zhang
SPShanwen Pu
Shanwen Pu
JGJianjun Gao
Jianjun Gao
ZWZaiwen Wen
Zaiwen Wen
Integer programming with block structures has received considerable attention recently and is widely used in many practical applications such as train timetabling and vehicle routing problems. It is known to be NP-hard due to the presence of integer variables. We define a novel augmented Lagrangian function by directly penalizing the inequality constraints and establish the strong duality between the primal problem and the augmented Lagrangian dual problem. Then, a customized augmented Lagrangian method is proposed to address the block-structures. In particular, the minimization of the augmented Lagrangian function is decomposed into multiple subproblems by decoupling the linking constraints and these subproblems can be efficiently solved using the block coordinate descent method. We also establish the convergence property of the proposed method. To make the algorithm more practical, we further introduce several refinement techniques to identify high-quality feasible solutions. Numerical experiments on a few interesting scenarios show that our proposed algorithm often achieves a satisfactory solution and is quite effective.

27 October 2024
Verified
Conference Paper
Open access
CZChunyuan Zhao
Chunyuan Zhao
ZGZizheng Guo
Zizheng Guo
RWRui Wang
Rui Wang
ZWZaiwen Wen
Zaiwen Wen
YLYun Liang
Yun Liang
YLYibo Lin
Yibo Lin

12 June 2021 in Computational Optimization and Applications
Verified
Journal Article
Closed access
PDF file
RWRui Wang
Rui Wang
NXNaihua Xiu
Naihua Xiu
KTKim-Chuan Toh
Kim-Chuan Toh