We consider a dual method for solving non-strictly convex programs possessing a certain separable structure. This method may be viewed as a dual version of a block coordinate ascent method studied by Auslender [1, Section 6]. We show that the decomposition methods of Han [6, 7] and the ...
To fill the gap, in this paper we focus on the strictly contractive PRSM (SC-PRSM) applied to 2-block linearly constrained convex minimization problems with quadratic coupling objective functions. Under mild conditions, we prove the convergence of our proposed SC-PRSM and ...
To fill the gap, in this paper we focus on the strictly contractive PRSM (SC-PRSM) applied to 2-block linearly constrained convex minimization problems with quadratic coupling objective functions. Under mild conditions, we prove the convergence of our proposed SC-PRSM and establish its o(1/k...
Under some weaker assumptions, without strict complementary condition, the algorithm is globally and superlinearly convergent. 在不需要严格互补条件的较弱假设下,算法是整体和超线性收敛的。 2. The algorithm uses the nonmonotone line search and no longer uses the strict complementary condition. 本文给...