Interior-point lagrangian decomposition method for separable convex optimization

Journal of Optimization Theory and Applications

Volumn 143, Issue 3, 2009, Pages 567-588

  Necoara, I ^a,b   Suykens, J A K ^b  

^a UNIVERSITY POLITEHNICA OF BUCHAREST   (Romania)

^b UNIVERSITY OF LEUVEN   (Belgium)

Author keywords

Augmented Lagrangian decomposition; Interior point methods; Parallel computations; Self concordant functions; Separable convex optimization

Indexed keywords

CONSTRAINED OPTIMIZATION; LAGRANGE MULTIPLIERS; LINEAR PROGRAMMING; NEWTON-RAPHSON METHOD;

AUGMENTED LAGRANGIAN DECOMPOSITION; AUGMENTED LAGRANGIANS; CONVEX OPTIMISATION; INTERIOR POINT; INTERIOR-POINT METHOD; LAGRANGIAN DECOMPOSITION; LARGE-SCALES; PARALLEL COMPUTATION; SELF-CONCORDANT FUNCTIONS; SEPARABLE CONVEX OPTIMIZATION;

CONVEX OPTIMIZATION;

EID: 70450125171     PISSN: 00223239     EISSN: 15732878     Source Type: Journal    
DOI: 10.1007/s10957-009-9566-8     Document Type: Article

References (18)

1. Xiao, L., Johansson, M., Boyd, S.: Simultaneous routing and resource allocation via dual decomposition. IEEE Trans. Commun. 52(7), 1136-1144 (2004).
2. Gondzio, J., Sarkissian, R.: Parallel interior point solver for structured linear programs. Math. Program. 96, 561-584 (2003).
3. Venkat, A., Hiskens, I., Rawlings, J., Wright, S.: Distributed MPC strategies with application to power system automatic generation control. IEEE Trans. Control Syst. Technol. 16(6), 1192-1206 (2008).
4. Necoara, I., Suykens, J. A. K.: Application of a smoothing technique to decomposition in convex optimization. IEEE Trans. Autom. Control 53(11), 2674-2679 (2008).
5. Zhao, G.: A Lagrangian dual method with self-concordant barriers for multi-stage stochastic convex programming. Math. Program. 102, 1-24 (2005).
6. Bertsekas, D. P., Tsitsiklis, J. N.: Parallel and Distributed Computation: Numerical Methods. Prentice-Hall, Englewood Cliffs (1989).
7. Lemarechal, C., Ouorou, A., Petrou, G.: A bundle-type algorithm for routing in telecommunication data networks. Comput. Optim. Appl. (2008).
8. Kontogiorgis, S., De Leone, R., Meyer, R.: Alternating direction splittings for block angular parallel optimization. J. Optim. Theory Appl. 90(1), 1-29 (1996).
9. Chen, G., Teboulle, M.: A proximal-based decomposition method for convex minimization problems. Math. Program. 64, 81-101 (1994).
10. Kojima, M., Megiddo, N., Mizuno, S., Shindoh, S.: Horizontal and vertical decomposition in interior point methods for linear programs. Dept. of Mathematical and Computing Sciences Technical report, Tokyo Institute of Technology (1993).
11. Kortanek, K. O., Potra, F., Ye, Y.: On some efficient interior-point methods for nonlinear convex programming. Linear Algebra Appl. 152, 169-189 (1991).
12. Tseng, P.: Global linear convergence of a path-following algorithm for some monotone variational inequality problems. J. Optim. Theory Appl. 75(2), 265-279 (1992).
13. Zhu, J.: A path following algorithm for a class of convex programming problems. Math. Methods Oper. Res. 36(4), 359-377 (1992).
14. Hegland, M., Osborne, M. R., Sun, J.: Parallel interior point schemes for solving multistage convex programming. Ann. Oper. Res. 108(1-4), 75-85 (2001).
15. Miele, A., Moseley, P. E., Levy, A. V., Coggins, G. M.: On the method of multipliers for mathematical programming problems. J. Optim. Theory Appl. 10, 1-33 (1972).
16. Nesterov, Y., Nemirovskii, A.: Interior Point Polynomial Algorithms in Convex Programming. SIAM Studies in Applied Mathematics. Society for Industrial and Applied Mathematics, Philadelphia (1994).
17. Renegar, J.: A Mathematical View of Interior-Point Methods for Convex Optimization. MPS-SIAM Series on Optimization. Philadelphia (2001).
18. Mayne, D. Q., Rawlings, J. B., Rao, C. V., Scokaert, P. O. M.: Constrained model predictive control: stability and optimality. Automatica 36(7), 789-814 (2000).