[1] Ferris M C, Mangasarian O L. Parallel variable distribution. SIAM Journal on Optimization, 1994, 1(1): 487--500
[2] Bertsekas D P, Tsitsiklis J N. Parallel and Distributed Computation. New Jersey: Prentice Hall, Englewood Cliffs, 1989
[3] Tseng P. Dual coordinate ascent methods for non-strictly convex minimization. Mathematical Programming, 1993, 59(2): 231--247
[4] Solodov M V. New inexact parallel variable distribution algorithms. Computational Optimization and Applications, 1997, 7(2): 165--182
[5] Solodov M V. On the convergence of constrained parallel variable distribution algorithms. SIAM Journal on Optimization, 1998, 8(1): 187--196
[6] Sagastiz\'{a}bal C A, Solodov M V. Parallel variable distribution for constrained optimization. Computational Optimization and Applications, 2002, 22(1): 111--131
[7] Zhu Z B. A simple feasible SQP algorithm for inequality constrained optimization. Applied Mathematics and Computation, 2006,
182(2): 987--998
[8] Han C Y, Wang Y L, He G P. On the convergence of asynchronous parallel algorithm for large-scale linearly constrained minimization
problem. Applied Mathematics and Computation, 2009, 211(2): 434--441
[9] Fukushima M. Parallel variable transformation in unconstrained optimization. SIAM Journal on Optimization, 1998, 8(3): 658--672
[10] Fang L, He G P, Wang Y L. A new non-interior-point continuation method for nonlinear complementarity problem with P0-function.
Acta Mathematica Scientia, 2011, 31A(1): 229--238 |