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

基于Schur补的凸二次锥规划的半邻近ADMM及其扩张

A Schur Complement Based Semi-Proximal ADMM for Convex Quadratic Conic Programming and Extensions

Xudong Li, Defeng Sun, Kim-Chuan Toh

摘要:

本文设计了一种高效收敛的乘子{半近似}交替方向法(ADMM),用于求解凸二次圆锥规划及相关问题的中低精度解.对于这类问题,收敛的两块半近似ADMM可以直接求解其原始形式。然而,它是已知的,它是更有效的应用直接扩展的多块半邻近ADMM,虽然它的收敛性不能保证,这些问题的对偶形式。自然地,人们可能会问以下问题:可以构造比直接扩展的半邻近ADMM更有效的收敛的多块半邻近ADMM吗?事实上,对于具有4块约束的线性圆锥规划,这在Sun,Toh和Yang的最近论文中已经被证明是可以实现的[arXiv预印本arXiv:1404.5378,(2014)]。受上述工作的启发,结合凸二次锥规划,我们提出了一种基于Schur补的收敛半近似ADMM,用于求解具有耦合线性等式约束的凸规划问题,其目标函数是两个真闭凸函数加上任意数量的凸二次或线性函数的和.我们的收敛半近似ADMM是特别适合于解决凸二次半定规划(QSDP)的约束组成的线性等式,一个半正定锥和一个简单的凸多面体集。我们所提出的算法的效率证明了各种例子,包括QSDP的数值实验。

英文摘要:

This paper is devoted to the design of an efficient and convergent {semi-proximal} alternating direction method of multipliers (ADMM) for finding a solution of low to medium accuracy to convex quadratic conic programming and related problems. For this class of problems, the convergent two block semi-proximal ADMM can be employed to solve their primal form in a straightforward way. However, it is known that it is more efficient to apply the directly extended multi-block semi-proximal ADMM, though its convergence is not guaranteed, to the dual form of these problems. Naturally, one may ask the following question: can one construct a convergent multi-block semi-proximal ADMM that is more efficient than the directly extended semi-proximal ADMM? Indeed, for linear conic programming with 4-block constraints this has been shown to be achievable in a recent paper by Sun, Toh and Yang [arXiv preprint arXiv:1404.5378, (2014)]. Inspired by the aforementioned work and with the convex quadratic conic programming in mind, we propose a Schur complement based convergent semi-proximal ADMM for solving convex programming problems, with a coupling linear equality constraint, whose objective function is the sum of two proper closed convex functions plus an arbitrary number of convex quadratic or linear functions. Our convergent semi-proximal ADMM is particularly suitable for solving convex quadratic semidefinite programming (QSDP) with constraints consisting of linear equalities, a positive semidefinite cone and a simple convex polyhedral set. The efficiency of our proposed algorithm is demonstrated by numerical experiments on various examples including QSDP.

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

↑