Parallel Iterative Methods for Nonlinear Programming Problems
In this paper, we present two parallel multiplicative algorithms for convex programming. If the objective function is differentiable and convex on the positive orthant of , and it has compact level sets and has a locally Lipschitz continuous gradient, we prove these algorithms converge to a solution of minimization problem. For the proofs there are essentially used the results of sequential methods shown by Eggermont.
Z. Chen "Parallel Iterative Methods for Nonlinear Programming Problems", Advanced Materials Research, Vol. 159, pp. 105-110, 2011