Skip to main content

Direct Solution of Linear Systems of Size 109 Arising in Optimization with Interior Point Methods

  • Conference paper
Parallel Processing and Applied Mathematics (PPAM 2005)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 3911))

Abstract

Solution methods for very large scale optimization problems are addressed in this paper. Interior point methods are demonstrated to provide unequalled efficiency in this context. They need a small (and predictable) number of iterations to solve a problem. A single iteration of interior point method requires the solution of indefinite system of equations. This system is regularized to guarantee the existence of triangular decomposition. Hence the well-understood parallel computing techniques developed for positive definite matrices can be extended to this class of indefinite matrices. A parallel implementation of an interior point method is described in this paper. It uses object-oriented programming techniques and allows for exploiting different block-structures of matrices. Our implementation outperforms the industry-standard optimizer, shows very good parallel efficiency on massively parallel architecture and solves problems of unprecedented sizes reaching 109 variables.

Supported by the Engineering and Physical Sciences Research Council of UK, EPSRC grant GR/R99683/01.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Karmarkar, N.K.: A new polynomial–time algorithm for linear programming. Combinatorica 4, 373–395 (1984)

    Article  MathSciNet  MATH  Google Scholar 

  2. Wright, S.J.: Primal-Dual Interior-Point Methods. SIAM, Philadelphia (1997)

    Google Scholar 

  3. Andersen, E.D., Gondzio, J., Mészáros, C., Xu, X.: Implementation of interior point methods for large scale linear programming. In: Terlaky, T. (ed.) Interior Point Methods in Mathematical Programming, pp. 189–252. Kluwer Acad. Pub., Dordrecht (1996)

    Chapter  Google Scholar 

  4. Altman, A., Gondzio, J.: Regularized symmetric indefinite systems in interior point methods for linear and quadratic optimization. Optimization Methods and Software 11-12, 275–302 (1999)

    Article  MathSciNet  MATH  Google Scholar 

  5. Gondzio, J., Sarkissian, R.: Parallel interior point solver for structured linear programs. Mathematical Programming 96(3), 561–584 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  6. Gondzio, J., Grothey, A.: Parallel interior point solver for structured quadratic programs: Application to financial planning problems. Technical Report MS-03-001, School of Mathematics, University of Edinburgh, Edinburgh EH9 3JZ, Scotland, UK (2003) Annals of Operations Research (accepted for publication)

    Google Scholar 

  7. Gondzio, J., Grothey, A.: Exploiting structure in parallel implementation of interior point methods for optimization. Technical Report MS-04-004, School of Mathematics, University of Edinburgh, Edinburgh EH9 3JZ, Scotland, UK (2004)

    Google Scholar 

  8. Gondzio, J., Grothey, A.: Solving nonlinear portfolio optimization problems with the primal-dual interior point method. Technical Report MS-04-001, School of Mathematics, University of Edinburgh, Edinburgh EH9 3JZ, Scotland, UK (2004) European Journal of Operational Research (accepted for publication)

    Google Scholar 

  9. Ziemba, W.T., Mulvey, J.M.: Worldwide Asset and Liability Modeling. Publications of the Newton Institute. Cambridge University Press, Cambridge (1998)

    Google Scholar 

  10. Arioli, M., Duff, I.S., de Rijk, P.P.M.: On the augmented system approach to sparse least-squares problems. Numerische Mathematik 55, 667–684 (1989)

    Article  MathSciNet  MATH  Google Scholar 

  11. Duff, I.S., Erisman, A.M., Reid, J.K.: Direct methods for sparse matrices. Oxford University Press, New York (1987)

    MATH  Google Scholar 

  12. Vanderbei, R.J.: Symmetric quasidefinite matrices. SIAM Journal on Optimization 5, 100–113 (1995)

    Article  MathSciNet  MATH  Google Scholar 

  13. Konno, H., Shirakawa, H., Yamazaki, H.: A mean-absolute deviation-skewness portfolio optimization model. Annals of Operational Research 45, 205–220 (1993)

    Article  MathSciNet  MATH  Google Scholar 

  14. Markowitz, H.M.: Portfolio selection. Journal of Finance, 77–91 (1952)

    Google Scholar 

  15. Steinbach, M.: Markowitz revisited: Mean variance models in financial portfolio analysis. SIAM Review 43(1), 31–85 (2001)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Gondzio, J., Grothey, A. (2006). Direct Solution of Linear Systems of Size 109 Arising in Optimization with Interior Point Methods. In: Wyrzykowski, R., Dongarra, J., Meyer, N., Waśniewski, J. (eds) Parallel Processing and Applied Mathematics. PPAM 2005. Lecture Notes in Computer Science, vol 3911. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11752578_62

Download citation

  • DOI: https://doi.org/10.1007/11752578_62

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-34141-3

  • Online ISBN: 978-3-540-34142-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics