A Restarted Primal-Dual Hybrid Conjugate Gradient Method for Large-Scale Quadratic Programming

Convex quadratic programming (QP) is an essential class of optimization problems with broad applications across various fields. Traditional QP solvers, typically based on simplex or barrier methods, face significant scalability challenges. In response to these limitations, recent research has shifted toward matrix-free first order methods to enhance scalability in QP. Among these, the restarted accelerated primal-dual hybrid gradient (rAPDHG) method proposed by Lu and Yang has recently gained notable attention because of its linear convergence rate to an optimal solution and its straightforward implementation on graphics processing units (GPUs). Building on this framework, this paper introduces a restarted primal-dual hybrid conjugate gradient (PDHCG) method, which incorporates conjugate gradient techniques to address the primal subproblems inexactly. We demonstrate that PDHCG maintains a linear convergence rate with an improved convergence constant and is also straightforward to implement on GPUs. Extensive numerical experiments on both synthetic and real-world data sets demonstrate that our method significantly reduces the number of iterations required to achieve the desired accuracy compared with rAPDHG. Additionally, the GPU implementation of our method achieves state-of-the-art performance on large-scale problems. In large-scale scenarios, our method demonstrates superior performance compared with existing methods. These results highlight the substantial potential of the proposed PDHCG method to greatly improve both the efficiency and scalability of solving complex quadratic programming challenges. History: Accepted by Andrea Lodi, Area Editor for Design & Analysis of Algorithms–Discrete. Funding: Y. Huang, W. Zhang, H. Li, and D. Ge were supported in part by the National Natural Science Foundation of China (NSFC) [Grants 72225009, 72394360, 72394365]. H. Liu was also supported in part by the NSFC [Grants 12301403, 72192830, 72192832]. 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.2024.0983 ) as well as from the IJOC GitHub software repository ( https://github.com/INFORMSJoC/2024.0983 ). The complete IJOC Software and Data Repository is available at https://informsjoc.github.io/ .

Authors

Institutions

Publication Details

Journal
INFORMS journal on computing
Published
2025-11-20
DOI
https://doi.org/10.1287/ijoc.2024.0983
Primary Topic
Advanced Optimization Algorithms Research
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

A Restarted Primal-Dual Hybrid Conjugate Gradient Method for Large-Scale Quadratic Programming

Dongdong Ge, Yinyu Ye, Wanyu Zhang, Huikang Liu et al.
INFORMS journal on computing
Advanced Optimization Algorithms Research
article

A Restarted Primal-Dual Hybrid Conjugate Gradient Method for Large-Scale Quadratic Programming

Dongdong Ge, Yinyu Ye, Wanyu Zhang, Huikang Liu, Yicheng Huang, Hongpei Li
article en

Abstract

Convex quadratic programming (QP) is an essential class of optimization problems with broad applications across various fields. Traditional QP solvers, typically based on simplex or barrier methods, face significant scalability challenges. In response to these limitations, recent research has shifted toward matrix-free first order methods to enhance scalability in QP. Among these, the restarted accelerated primal-dual hybrid gradient (rAPDHG) method proposed by Lu and Yang has recently gained notable attention because of its linear convergence rate to an optimal solution and its straightforward implementation on graphics processing units (GPUs). Building on this framework, this paper introduces a restarted primal-dual hybrid conjugate gradient (PDHCG) method, which incorporates conjugate gradient techniques to address the primal subproblems inexactly. We demonstrate that PDHCG maintains a linear convergence rate with an improved convergence constant and is also straightforward to implement on GPUs. Extensive numerical experiments on both synthetic and real-world data sets demonstrate that our method significantly reduces the number of iterations required to achieve the desired accuracy compared with rAPDHG. Additionally, the GPU implementation of our method achieves state-of-the-art performance on large-scale problems. In large-scale scenarios, our method demonstrates superior performance compared with existing methods. These results highlight the substantial potential of the proposed PDHCG method to greatly improve both the efficiency and scalability of solving complex quadratic programming challenges. History: Accepted by Andrea Lodi, Area Editor for Design & Analysis of Algorithms–Discrete. Funding: Y. Huang, W. Zhang, H. Li, and D. Ge were supported in part by the National Natural Science Foundation of China (NSFC) [Grants 72225009, 72394360, 72394365]. H. Liu was also supported in part by the NSFC [Grants 12301403, 72192830, 72192832]. 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.2024.0983 ) as well as from the IJOC GitHub software repository ( https://github.com/INFORMSJoC/2024.0983 ). The complete IJOC Software and Data Repository is available at https://informsjoc.github.io/ .

INFORMS journal on computing
Shanghai University of Finance and Economics (CN), Shanghai Jiao Tong University (CN), Stanford University (US)
Openalex Percentile: Top 51%
Advanced Optimization Algorithms Research
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.