On Glowinski's Open Question on the Alternating Direction Method of Multipliers

被引:11
作者
Tao, Min [1 ]
Yuan, Xiaoming [2 ]
机构
[1] Nanjing Univ, Dept Math, Natl Key Lab Novel Software Technol, Nanjing, Jiangsu, Peoples R China
[2] Univ Hong Kong, Dept Math, Hong Kong, Hong Kong, Peoples R China
关键词
Alternating direction method of multipliers; Glowinski's open question; Quadratic programming; Step size; Linear convergence; LOCAL LINEAR CONVERGENCE; PROXIMAL POINT ALGORITHM; EQUALITY;
D O I
10.1007/s10957-018-1338-x
中图分类号
C93 [管理学]; O22 [运筹学];
学科分类号
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要
The alternating direction method of multipliers was proposed by Glowinski and Marrocco in 1974, and it has been widely used in a broad spectrum of areas, especially in some sparsity-driven application domains. In 1982, Fortin and Glowinski suggested to enlarge the range of the dual step size for updating the multiplier from 1 to the open interval of zero to the golden ratio, and this strategy immediately accelerates the convergence of alternating direction method of multipliers for most of its applications. Meanwhile, Glowinski raised the question of whether or not the range can be further enlarged to the open interval of zero to 2; this question remains open with nearly no progress in the past decades. In this paper, we answer this question affirmatively for the case where both the functions in the objective function are quadratic. Thus, Glowinski's open question is partially answered. We further establish the global linear convergence of the alternating direction method of multipliers with this enlarged step size range for the quadratic programming under a tight condition.
引用
收藏
页码:163 / 196
页数:34
相关论文
共 41 条
[1]  
[Anonymous], 1984, Numerical Methods for Nonlinear Variational Problems
[2]  
[Anonymous], 2013, Matrix Analysis
[3]  
[Anonymous], 1986, Power systems analysis
[4]   Rigorous convergence analysis of alternating variable minimization with multiplier methods for quadratic programming problems with equality constraints [J].
Bai, Zhong-Zhi ;
Tao, Min .
BIT NUMERICAL MATHEMATICS, 2016, 56 (02) :399-422
[5]  
Bjorck A, 1996, NUMERICAL METHODS LE
[6]   LOCAL LINEAR CONVERGENCE OF THE ALTERNATING DIRECTION METHOD OF MULTIPLIERS ON QUADRATIC OR LINEAR PROGRAMS [J].
Boley, Daniel .
SIAM JOURNAL ON OPTIMIZATION, 2013, 23 (04) :2183-2207
[7]  
Boyd S., 2011, FOUND TRENDS MACH LE, V3, P1, DOI DOI 10.1561/2200000016
[8]   From Sparse Solutions of Systems of Equations to Sparse Modeling of Signals and Images [J].
Bruckstein, Alfred M. ;
Donoho, David L. ;
Elad, Michael .
SIAM REVIEW, 2009, 51 (01) :34-81
[9]   Extended ADMM and BCD for nonseparable convex minimization models with quadratic coupling terms: convergence analysis and insights [J].
Chen, Caihua ;
Li, Min ;
Liu, Xin ;
Ye, Yinyu .
MATHEMATICAL PROGRAMMING, 2019, 173 (1-2) :37-77
[10]  
Chua L., 1987, Linear and Nonlinear Circuits