Korean Management Science Review (경영과학)

The Korean Operations Research and Management Science Society (한국경영과학회)
권호 표지

Computational Experience of Linear Equation Solvers for Self-Regular Interior-Point Methods

자동조절자 내부점 방법을 위한 선형방정식 해법

  • Published : 2004.11.01
Download PDF
⟨ Previous Next ⟩

Abstract

Every iteration of interior-point methods of large scale optimization requires computing at least one orthogonal projection. In the practice, symmetric variants of the Gaussian elimination such as Cholesky factorization are accepted as the most efficient and sufficiently stable method. In this paper several specific implementation issues of the symmetric factorization that can be applied for solving such equations are discussed. The code called McSML being the result of this work is shown to produce comparably sparse factors as another implementations in the $MATLAB^{***}$ environment. It has been used for computing projections in an efficient implementation of self-regular based interior-point methods, McIPM. Although primary aim of developing McSML was to embed it into an interior-point methods optimizer, the code may equally well be used to solve general large sparse systems arising in different applications.

Keywords

References

  1. 도승용, 성명기, 박순달, '내부점 방법에서 augmented system의 출레스키 분해'，'한국경 영과학회지', 제28권, 제1호(2003), pp.51-61
  2. 박순달, 김우제, 설동렬, 박찬규, 성명기, 임성묵, ‘고등선형계획법’，초판, 교우사，2001
  3. 설동렬，도승용，박순달，‘내부점 방법에서 밀집열 처리에 관한 연구 - Schur 상보법의 효율적인 구현', ’한국경영과학회 ’98 추계학술대회 논문집‘(1998)，pp.67-70
  4. 설동렬，정호원，박순달，‘내부정방법을 위한 초마디 열출레스키 분해의 실험적 고찰' ’경영과학‘，제15권，제1호(1998)，pp.87-96
  5. Altman, A. and J. Gondzio, 'Regularized symmetric indefinite systems in interior point methods for linear and quadratic optimization,' Optimization Methods and Software, Vol.11-12(1999), pp.275-302
  6. Andersen, E.D., J. Gondzio, C. Meszaros and X. Xu, 'Implementation of interior point methods for large scale linear programming,' Interior Point Methods in Mathematical Programming, T. Terlaky (ed.), Kluwer Academic Pub., 1996
  7. Anderson, E., Z. Bai, C. Bischof, S. Blackford, J. Demmel, J. Dongarra, J. Du Croz, A Greenbaum, S. Hammarling, A McKenney, and D. Sorensen, LAPACK User's Guide(http://www.netlib.org/lapack/lug/lapack.lug.html), Third Edition, SIAM, Philadelphia, 1999
  8. Duff, I.S., A. Erisman and J. Reid, Direct Methods for Sparse Matrices, Monographs on Numerical Analysis, Clarendon Press, Oxford, 1986
  9. Duff, I.S. and J. Reid, 'Exploiting zeros on the diagonal in the direct solution of indefinite sparse symmetric linear systems,' ACM TOMS, Vol.22, Issue 2(1996), pp, 227-257
  10. Duff, I.S., N. Gould, J. Reid, J. Scott, K. Turner, 'The factorization of sparse symmetric indefinite matrices,' IMA J. Numer. Anal., Vol.11(1991), pp.181-204
  11. Fourer, R. and S. Mehrotra, 'Solving symmetric indefinite systems in an interiorpoint method for linear programming,' Math Prog., Vol.62, No.1(1993), pp.15-39 https://doi.org/10.1007/BF01585158
  12. Gay, D.M., 'Electronic mail distribution of linear programming test problems,' Mathematical Programming Society Committee on Algorithms Newsletter, No.13(1985), pp.10-12
  13. George, A. and J. Liu, Computer Solution of Large Sparse Positive Definie Systems, Prentice Hall Inc., Englewood Cliffs, New Jersey, 1981
  14. Gilbert, J, C. Moler and R. Schreiber, 'Sparse Matrices in MATLAB : design and implementation,' SIAM Journal on Matrix Analysis and Applications, Vol.13(1992), pp.333-356
  15. Gondzio, J, 'Implementing Cholesky factorization for interior point methods of linear programming,' Optimization, Vol.27(1993), pp.121-140
  16. Liu, J, 'Modification of the minimum-degree algorithm by multiple elimination,' ACM TOMS, Vol.11, Issue 2(1985), pp.141-153
  17. Maros, I. and C. Meszaros, 'The role of the augmented system in interior point methods,' EJOR, Vol.107(1998), pp.720-736
  18. Meszaros, C., 'Fast Cholesky factorization for interior point methods of linear programming,' Comp. Math Appl., Vol.31, NO.4 (1996), pp.49-51
  19. Meszaros, C., 'The augmented sywstem variant of IPMs in two-stage stochastic linear programming computation,' EJOR, Vol.101, No.2(1997), pp.317-327 https://doi.org/10.1016/S0377-2217(96)00400-6
  20. Meszaros, C., 'On a property of the Cholesky factorization and its consequences in interior point methods,' WP 98-7 Laboratory of Operations Research and Decision Systems Hungarian Academy of Sciences, 1998
  21. Esmond, N. and B. Peyton, 'Block sparse Cholesky algorithms on advanced uniprocessor computers,' Technical Report ORNL/TM-11960, Oak Ridge National Laboratory, Oak Ridge, Tennessee, 1991
  22. Park, C.K., S. Doh, S. Park and W. Kim, 'A minimum degree ordering algorithm using the lower and upper bounds of degrees,' Int. Journal of Management Science, Vol. 8, No.l(2002), pp.1-19
  23. Peng, J., C. Roos and T. Terlaky, Self-Regularity : A New Paradigm for Primal-Dual Interior-Point Algorithms, Princeton University Press, Princeton, New jessy, 2002
  24. Saunders, M. and J. Tomlin, 'Solving regularized linear programs using barrier methods and KKT systems,' Report SOL 96-4 Dept. of EESOR, Stanford Univ., 1996
  25. Seol, T. and S. Park, 'Solving linear systems in interior-point methods,' Computers & Operations Research, Vol.28, No.4 (2002), pp.317-326
  26. Vanderbei, R., 'Symmetric Quasidefinite Matrices,' SIAM J. Opt., Vol.5, No.1(1995), pp.100-113 https://doi.org/10.1137/0805005
  27. Vanderbei, R. and T. Carpenter, 'Symmetric indefinite systems for interior-point methods,' Math Prog., Vol.58, No.l (1993), pp.1-32
  28. Zhang, Y, 'Solving large-scale linear programs by interior-point methods under the MATLAB Environment,' Optimization Methods and Software, Vol.10(1998), pp.1-31
  29. Zhu, X., J. Peng, T. Terlaky and G. Zhang, 'On implementing self-regular proximity based feasible IPMs,' AdvOI-Report# 2004/ 3, 2004