PARALLEL MULTIPLICATIVE ITERATIVE METHODS FOR CONVEX PROGRAMMING  

作　　者：陈忠 费浦生 

出　　处：《Acta Mathematica Scientia》1997年第2期205-210,共6页数学物理学报（B辑英文版）

摘　　要：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 Eggermontt[1].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 Eggermontt[1].

关 键 词：parallel algorithm convex programming 

分 类 号：O221[理学—运筹学与控制论]