Parallel interior-point solver for structured quadratic programs: Application to financial planning problems
- 210 Downloads
Many practical large-scale optimization problems are not only sparse, but also display some form of block-structure such as primal or dual block angular structure. Often these structures are nested: each block of the coarse top level structure is block-structured itself. Problems with these characteristics appear frequently in stochastic programming but also in other areas such as telecommunication network modelling.
We present a linear algebra library tailored for problems with such structure that is used inside an interior point solver for convex quadratic programming problems. Due to its object-oriented design it can be used to exploit virtually any nested block structure arising in practical problems, eliminating the need for highly specialised linear algebra modules needing to be written for every type of problem separately. Through a careful implementation we achieve almost automatic parallelisation of the linear algebra.
The efficiency of the approach is illustrated on several problems arising in the financial planning, namely in the asset and liability management. The problems are modelled as multistage decision processes and by nature lead to nested block-structured problems. By taking the variance of the random variables into account the problems become non-separable quadratic programs. A reformulation of the problem is proposed which reduces density of matrices involved and by these means significantly simplifies its solution by an interior point method. The object-oriented parallel solver achieves high efficiency by careful exploitation of the block sparsity of these problems. As a result a problem with over 50 million decision variables is solved in just over 2 hours on a parallel computer with 16 processors. The approach is by nature scalable and the parallel implementation achieves nearly perfect speed-ups on a range of problems.
KeywordsStructure exploitation Stochastic programming Portfolio optimization Interior point methods
Unable to display preview. Download preview PDF.
- Andersen, E.D., J. Gondzio, C. Mészáros, and X. Xu. (1996). “Implementation of Interior Point Methods for Large Scale Linear Programming.” In T. Terlaky (ed.), Interior Point Methods in Mathematical Programming. pp. 189–252 Kluwer Academic Publishers.Google Scholar
- Benson, S., L.C. McInnes, and J.J. Moré. (2001). “TAO Users Manual.” Technical Report ANL/MCS-TM-249, Argonne National Laboratory.Google Scholar
- Birge, J.R. (1985). “Decomposition and Partitioning Methods for Multistage Stochastic Linear Programs.” Operations Research, 33, 989–1007.Google Scholar
- Birge, J.R. and L. Qi. (1988). “Computing Block-Angular Karmarkar Projections with Applications to Stochastic Programming.” Management Science, 34(12), 1472–1479.Google Scholar
- Bradley, S. and D. Crane. (1972). “A Dynamic Model for Bond Portfolio Management.” Management Science, 19, 139–151.Google Scholar
- Cariño, D., T. Kent, D. Myers, C. Stacy, M. Sylvanus, A. Turner, K. Watanabe, and W. Ziemba. (1994). “The Russel-Yasuda Kasai model: An Asset/liability Model for Japanese Insurance Company Using Multistage Stochastic Programming.” Interfaces, 24(1), 29–49.Google Scholar
- Cristianini, N. and J. Shawe-Taylor. (2000). An Introduction to Support Vector Machines and Other Kernel Based Learning Methods, Cambridge University Press.Google Scholar
- Duff, I.S., A.M. Erisman, and J.K. Reid. (1987). Direct Methods for Sparse Matrices, Oxford University Press, New York.Google Scholar
- Ferris, M.C. and D.J. Horn. (1998). “Partitioning Mathematical Programs for Parallel Solution.” Mathematical Programming, 80, 35–62.Google Scholar
- Gondzio, J. (1996). “Multiple Centrality Corrections in a Primal-Dual Method for Linear Programming.” Computational Optimization and Applications, 6, 137–156.Google Scholar
- Kusy, M. and W. Ziemba. (1986). “A Bank Asset and Liability Model.” Operations Research, 34, 356–376.Google Scholar
- Meza, J.C. (1994). “OPT++: An Object-Oriented Class Library for Nonlinear Optimization.” Technical Report SAND94-8225, Sandia National Laboratories.Google Scholar
- Parpas, P. and B. Rustem. (2003). “Decomposition of Multistage Stochastic Quadratic Problems in Financial Engineering.” Technical report, Department of Computing, Imperial College. Presented at the International Workshop on Comutational Management Science, Economics, Finance and Engineering, Cyprus, 28–30 March, 2003.Google Scholar
- Ruszczyński, A. (1985). “A Regularized Decomposition Method for Minimizing a Sum of Polyhedral Functions.” Mathematical Programming, 33, 309–333.Google Scholar
- Steinbach, M. (2000). “Hierarchical Sparsity in Multistage Convex Stochastic Programs.” In S. Uryasev and P.M. Pardalos (Eds.), Stochastic Optimization: Algorithms and Applications. pp. 363–388 Kluwer Academic Publishers.Google Scholar
- Steinbach, M. (2001). “Markowitz Revisited: Mean Variance Models in Financial Portfolio Analysis.” SIAM Review, 43(1), 31–85.Google Scholar
- Vanderbei, R.J. (1995). “Symmetric Quasidefinite Matrices.” SIAM Journal on Optimization, 5, 100–113.Google Scholar
- Wright, S.J. (1997). Primal-Dual Interior-Point Methods. SIAM, Philadelphia.Google Scholar
- Ziemba, W.T. and J.M. Mulvey. (1998). Worldwide Asset and Liability Modeling. Publications of the Newton Institute, Cambridge University Press, Cambridge.Google Scholar