Chuwen Zhang

Chuwen Zhang

Auto-generated profile, based on publicly available information

Chuwen Zhang

Research Institute for Interdisciplinary Sciences, School of Information Management and Engineering, Shanghai University of Finance and Economics, Shanghai 200433, China

Research Focus & Metrics

Academic Career Length

3Years (2024-Present)

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

Representative Publications

View All Publications
1 March 2025 in INFORMS Journal on Computing
Verified
Journal Article
Closed access
QDQi Deng
Qi Deng
QFQing Feng
Qing Feng
WGWenzhi Gao
Wenzhi Gao
DGDongdong Ge
Dongdong Ge
BJBo Jiang
Bo Jiang
CZChuwen Zhang
Chuwen Zhang
The alternating-direction-method-of-multipliers-based (ADMM-based) interior point method, or ABIP method, is a hybrid algorithm that effectively combines interior point method (IPM) and first-order methods to achieve a performance boost in large-scale linear optimization. Different from traditional IPM that relies on computationally intensive Newton steps, the ABIP method applies ADMM to approximately solve the barrier penalized problem. However, similar to other first-order methods, this technique remains sensitive to condition number and inverse precision. In this paper, we provide an enhanced ABIP method with multiple improvements. First, we develop an ABIP method to solve the general linear conic optimization and establish the associated iteration complexity. Second, inspired by some existing methods, we develop different implementation strategies for the ABIP method, which substantially improve its performance in linear optimization. Finally, we conduct extensive numerical experiments in both synthetic and real-world data sets to demonstrate the empirical advantage of our developments. In particular, the enhanced ABIP method achieves a 5.8× reduction in the geometric mean of run time on 105 selected linear optimization instances from Netlib, and it exhibits advantages in certain structured problems, such as support vector machine and PageRank. However, the enhanced ABIP method still falls behind commercial solvers in many benchmarks, especially when high accuracy is desired. We posit that it can serve as a complementary tool alongside well-established solvers. History: Accepted by Antonio Frangioni, Area Editor for Design & Analysis of Algorithms—Continuous. Funding: This research was supported by the National Natural Science Foundation of China [Grants 72394360, 72394364, 72394365, 72225009, 72171141, and 72150001] and by the Program for Innovative Research Team of Shanghai University of Finance and Economics. Supplemental Material: The software that supports the findings of this study is available within the paper and its Supplemental Information ( https://pubsonline.informs.org/doi/suppl/10.1287/ijoc.2023.0017 ) as well as from the IJOC GitHub software repository ( https://github.com/INFORMSJoC/2023.0017 ). The complete IJOC Software and Data Repository is available at https://informsjoc.github.io/ .

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.

1 May 2026 in Mathematics of Operations Research
Verified
Journal Article
Closed access
CZChuwen Zhang
Chuwen Zhang
CHChang He
Chang He
YJYuntian Jiang
Yuntian Jiang
CXChenyu Xue
Chenyu Xue
BJBo Jiang
Bo Jiang
Yinyu YeYinyu Ye
Yinyu Ye
In this paper, we introduce a homogeneous second-order descent method (HSODM) motivated from the homogenization trick in quadratic programming. The merit of homogenization is that only the leftmost eigenvector of a gradient-Hessian integrated matrix is computed at each iteration. Therefore, the algorithm is a single-loop method that does not need to switch to other sophisticated algorithms and is easy to implement. We show that HSODM has a global convergence rate of [ ] to find an [ ]-approximate second-order stationary point, and has a local quadratic convergence rate under the standard assumptions. The numerical results demonstrate the advantage of the proposed method over other second-order methods. Funding: This research was partially supported by the National Natural Science Foundation of China [Grants 72394360, 72394364, 72394365, 72225009, and 72171141] and by the Program for Innovative Research Team of the Shanghai University of Finance and Economics. Supplemental Material: Supplemental material is available at https://doi.org/10.1287/moor.2023.0132 .

31 May 2024
Verified
Journal Article
Closed access
QDQi Deng
Qi Deng
QFQing Feng
Qing Feng
WGWenzhi Gao
Wenzhi Gao
DGDongdong Ge
Dongdong Ge
BJBo Jiang
Bo Jiang
CZChuwen Zhang
Chuwen Zhang
ADMM-based Interior Point Method for Linear and Conic Programming (ABIP) is a new framework that applies alternating direction method of multipliers (ADMM) to implement interior point method (IPM) for solving large-scale linear programs (LP) and conic programs (QCP). ABIP (LP part) was initially developed by Tianyi Lin (https://github.com/tyDLin) and is currently maintained by LEAVES optimization software platform. The original ABIP follows the following paper: @article{lin_admm-based_2021, title = {An {ADMM}-based interior-point method for large-scale linear programming}, volume = {36}, number = {2-3}, journal = {Optimization Methods and Software}, author = {Lin, Tianyi and Ma, Shiqian and Ye, Yinyu and Zhang, Shuzhong}, year = {2021}, note = {Publisher: Taylor \& Francis}, pages = {389--424}, }

18 January 2026 in arXiv
Verified
Preprint
Open access
PDF file
CZChuwen Zhang
Chuwen Zhang
PSPengyi Shi
Pengyi Shi
AWAmy Ward
Amy Ward
Incarceration-diversion treatment programs aim to improve societal reintegration and reduce recidivism, but limited capacity forces policymakers to make prioritization decisions that often rely on risk assessment tools. While predictive, these tools typically treat risk as a static, individual attribute, which overlooks how risk evolves over time and how treatment decisions shape outcomes through social interactions. In this paper, we develop a new framework that models reoffending risk as a human-system interaction, linking individual behavior with system-level dynamics and endogenous community feedback. Using an agent-based simulation calibrated to U.S. probation data, we evaluate treatment allocation policies under different capacity constraints and incarceration settings. Our results show that no single prioritization policy dominates. Instead, policy effectiveness depends on temporal windows and system parameters: prioritizing low-risk individuals performs better when long-term trajectories matter, while prioritizing high-risk individuals becomes more effective in the short term or when incarceration leads to shorter monitoring periods. These findings highlight the need to evaluate risk-based decision systems as sociotechnical systems with long-term accountability, rather than as isolated predictive tools.