Xinyuan Zhao

Xinyuan Zhao

Auto-generated profile, based on publicly available information

Xinyuan Zhao

Department of Mathematics, Beijing University of Technology, Beijing, P.R. China

Research Focus & Metrics

Academic Career Length

15Years (2012-Present)

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

Representative Publications

View All Publications
22 February 2019 in Optimization Methods and Software
Verified
Journal Article
Closed access
DSDefeng Sun
Defeng Sun
KTKim-Chuan Toh
Kim-Chuan Toh
YYYancheng Yuan
Yancheng Yuan
XZXin-Yuan Zhao
Xin-Yuan Zhao
Sdpnal+ is a MATLAB software package that implements an augmented Lagrangian based method to solve large scale semidefinite programming problems with bound constraints. The implementation was initially based on a majorized semismooth Newton-CG augmented Lagrangian method, here we designed it within an inexact symmetric Gauss-Seidel based semi-proximal ADMM/ALM (alternating direction method of multipliers/augmented Lagrangian method) framework for the purpose of deriving simpler stopping conditions and closing the gap between the practical implementation of the algorithm and the theoretical algorithm. The basic code is written in MATLAB, but some subroutines in C language are incorporated via Mex files. We also design a convenient interface for users to input their SDP models into the solver. Numerous problems arising from combinatorial optimization and binary integer quadratic programming problems have been tested to evaluate the performance of the solver. Extensive numerical experiments conducted in [L.Q. Yang, D.F. Sun, and K.C. Toh, SDPNAL+: A majorized semismooth Newton-CG augmented Lagrangian method for semidefinite programming with nonnegative constraints, Math. Program. Comput. 7 (2015), pp. 331–366] show that the proposed method is quite efficient and robust, in that it is able to solve 98.9% of the 745 test instances of SDP problems arising from various applications to the accuracy of 10−6 in the relative KKT residual.

23 May 2025 in SIAM Journal on Optimization
Verified
Journal Article
Closed access
DSDefeng Sun
Defeng Sun
YYYancheng Yuan
Yancheng Yuan
GZGuojun Zhang
Guojun Zhang
XZXinyuan Zhao
Xinyuan Zhao
In this paper, we aim to accelerate a preconditioned alternating direction method of multipliers (pADMM), whose proximal terms are convex quadratic functions, for solving linearly constrained convex optimization problems. To achieve this, we first reformulate the pADMM into a form of the proximal point method (PPM) with a positive semidefinite preconditioner which can be degenerate due to the lack of strong convexity of the proximal terms in the pADMM. Then we accelerate the pADMM by accelerating the reformulated degenerate PPM (dPPM). Specifically, we first propose an accelerated dPPM by integrating the Halpern iteration and the fast Krasnosel’skiĭ–Mann iteration into it, achieving asymptotic [Formula: see text] and nonasymptotic [Formula: see text] convergence rates. Subsequently, building upon the accelerated dPPM, we develop an accelerated pADMM algorithm that exhibits both asymptotic [Formula: see text] and nonasymptotic [Formula: see text] nonergodic convergence rates concerning the Karush–Kuhn–Tucker residual and the primal objective function value gap. Preliminary numerical experiments validate the theoretical findings, demonstrating that the accelerated pADMM outperforms the pADMM in solving convex quadratic programming problems.

6 November 2023 in SIAM Journal on Optimization
Verified
Journal Article
Closed access
SWShiwei Wang
Shiwei Wang
CDChao Ding
Chao Ding
YZYangjing Zhang
Yangjing Zhang
XZXinyuan Zhao
Xinyuan Zhao
Strong variational sufficiency is a newly proposed property, which turns out to be of great use in the convergence analysis of multiplier methods. However, what this property implies for nonpolyhedral problems remains a puzzle. In this paper, we prove the equivalence between the strong variational sufficiency and the strong second-order sufficient condition (SOSC) for nonlinear semidefinite programming (NLSDP) without requiring the uniqueness of the multiplier or any other constraint qualifications. Based on this characterization, the local convergence property of the augmented Lagrangian method (ALM) for NLSDP can be established under the strong SOSC in the absence of constraint qualifications. Moreover, under the strong SOSC, we can apply the semismooth Newton method to solve the ALM subproblems of NLSDP because the positive definiteness of the generalized Hessian of augmented Lagrangian function is satisfied.

6 October 2025 in Mathematical Programming Computation
Verified
Journal Article
Open access
PDF file
KCKaihuang Chen
Kaihuang Chen
DSDefeng Sun
Defeng Sun
YYYancheng Yuan
Yancheng Yuan
GZGuojun Zhang
Guojun Zhang
XZXinyuan Zhao
Xinyuan Zhao
In this paper, we introduce an HPR-LP solver, an implementation of a Halpern Peaceman–Rachford (HPR) method with semi-proximal terms for solving linear programming (LP). The HPR method enjoys the iteration complexity of $$O(1/k)$$ O ( 1 / k ) in terms of the Karush–Kuhn–Tucker residual and the objective error. Based on the complexity results, we design an adaptive strategy of restart and penalty parameter update to improve the efficiency and robustness of the HPR method. We conduct extensive numerical experiments on different LP benchmark datasets using an NVIDIA A100-SXM4-80GB GPU in different stopping tolerances. Our solver’s Julia version achieves a 2.39x to 5.70x speedup measured by SGM10 on benchmark datasets with presolve ( 2.03x to 4.06x without presolve) over the award-winning solver PDLP with the tolerance of $$10^{-8}$$ 10 - 8 . The Julia implementation of HPR-LP is available for downloading at https://github.com/PolyU-IOR/HPR-LP .

28 December 2024 in Journal of Optimization Theory and Applications
Verified
Journal Article
Closed access
PDF file
BYBo Yang
Bo Yang
XZXinyuan Zhao
Xinyuan Zhao
XLXudong Li
Xudong Li
DSDefeng Sun
Defeng Sun

23 May 2021 in Journal of the Operations Research Society of China
Verified
Journal Article
Closed access
PDF file
YCYing Cui
Ying Cui
Chao DingChao Ding
Chao Ding
XLXu-Dong Li
Xu-Dong Li
XZXin-Yuan Zhao
Xin-Yuan Zhao