arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2510.11554math.OC
收藏

求解凸可分二次优化问题的一种高效求解方法

An Efficient Solution Method for Solving Convex Separable Quadratic Optimization Problems

Shaoze Li, Junhao Wu, Cheng Lu, Zhibin Deng, Shu-Cherng Fang

AI总结:

本文基于KKT系统的迭代求解方案,提出一种求解带多凸可分约束的二次规划问题的高效方法,证明其等价于对偶坐标上升算法,且数值实验表明其在大规模问题上优于Gurobi求解器。

摘要:

凸可分二次优化问题在许多实际应用中经常出现。本文基于KKT系统的迭代求解方案,针对受多个凸可分约束的凸可分目标函数的二次规划问题,开发了一种高效求解方法。我们证明该方法导出了对偶坐标上升算法,并提供了收敛性证明。数值实验表明,所提方法的性能优于Gurobi求解器,特别是在求解大规模凸可分二次规划问题时。

英文摘要:

Convex separable quadratic optimization problems occur in many practical applications. In this paper, based on an iterative resolution scheme of the KKT system, we develop an efficient method for solving a quadratic programming problem with a convex separable objective function subject to multiple convex separable constraints. We show that the proposed approach leads to a dual coordinate ascent algorithm and provide a convergence proof. Numerical experiments support the superior performance of the proposed method to that of the Gurobi solver, especially for solving large-scale convex separate quadratic programming problems.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑