期刊
OPERATIONS RESEARCH LETTERS
卷 26, 期 3, 页码 127-136出版社
ELSEVIER SCIENCE BV
DOI: 10.1016/S0167-6377(99)00074-7
关键词
nonlinear programming; algorithms; decomposition methods; Gauss-Seidel method
We give new convergence results fur the block Gauss-Seidel method for problems where the feasible set is the Cartesian product of m closed convex sets, under the assumption that the sequence generated by the method has limit points. We show that the method is globally convergent for m = 2 and that for in > 2 convergence can be established both when the objective function f is componentwise strictly quasiconvex with respect to m - 2 components and when f is pseudoconvex. Finally, we consider a proximal point modification of the method and we state convergence results without any convexity assumption on the objective function. (C) 2000 Elsevier Science B.V. All rights reserved.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据