An infeasible primal-dual interior point algorithm for linear programs based on logarithmic equivalent transformation

Journal of Mathematical Analysis and Applications

Volumn 314, Issue 2, 2006, Pages 644-660

  Pan, Shaohua ^a   Li, Xingsi ^b   He, Suyan ^c  

^a SOUTH CHINA UNIVERSITY OF TECHNOLOGY   (China)

^b DALIAN UNIVERSITY OF TECHNOLOGY   (China)

^c DALIAN UNIVERSITY   (China)

Author keywords

Centering equation; Entropy function; Equivalent algebraic transformation; Linear programming; Logarithmic transformation

Indexed keywords

EID: 29144520706     PISSN: 0022247X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.jmaa.2005.04.028     Document Type: Article

References (10)

1. P.E. Gill W. Murray M.A. Saunders et al. On projected Newton barrier methods for linear programming and an equivalence to Karmarkar's projective method Math. Programming 36 1986 183-209
2. N.K. Karmarkar A new polynomial-time algorithm for linear programming Combinatorica 4 1984 373-395
3. J. Peng C. Roos T. Terlaky New and efficient large-update interior-point method for linear optimization J. Comput. Technol. 4 2001 61-80
4. J. Peng C. Roos T. Terlaky Self-regular functions and new search directions for linear and semi-definite optimization Math. Program. 93 2002 129-171
5. J. Peng C. Roos T. Terlaky Self-Regularity: A New Paradigm for Primal-Dual Interior-Point Algorithms 2002 Princeton Univ. Press
6. C. Roos T. Terlaky Theory and Algorithms for Linear Optimization. An Interior Approach 1997 Wiley Chichester, UK
7. L. Tuncel M.J. Todd On the interplay among entropy, variable metrics and potential functions in interior-point algorithms Comput. Optim. Appl. 8 1997 5-19
8. S.J. Wright Primal-Dual Interior-Point Methods 1997 SIAM Philadelphia
9. Y. Ye Interior Point Algorithms, Theory and Analysis 1997 Wiley Chichester, UK
10. Zs. Darvay A new algorithm for solving self-dual linear optimization problems Studia Univ. Babȩs-Bolyai 47 2003 15-26