数学物理学报(英文版) ›› 1997, Vol. 17 ›› Issue (2): 205-210.
陈忠, 费浦生
Chen Zhong, Fei Pusheng
摘要： In this paper, we present two parallel multiplicative algorithms for convex programming. If the objective function has compact level sets and has a locally Lipschitz continuous gradient, we discuss convergence of the algorithms. The proofs are essentially based on the results of sequential methods shown by Eggermont[1].