A self-adjusting primal-dual interior point method for linear programs

Optimization Methods and Software

Volumn 19, Issue 3-4, 2004, Pages 389-397

  Pan, Shaohua ^a   Li, Xingsi ^b  

^a SOUTH CHINA UNIVERSITY OF TECHNOLOGY   (China)

^b DALIAN UNIVERSITY OF TECHNOLOGY   (China)

Author keywords

Central path; Interior point method; Linear programming; Proximity measure; Self adjusting

Indexed keywords

ALGORITHMS; COMPUTER SOFTWARE; FUNCTIONS; PARAMETER ESTIMATION; PERTURBATION TECHNIQUES; PROBLEM SOLVING;

CENTRAL PATH; INTERIOR POINT METHODS (IPM); PROXIMITY MEASURES; SELF-ADJUSTING MECHANISM;

LINEAR PROGRAMMING;

EID: 3042588570     PISSN: 10556788     EISSN: None     Source Type: Journal    
DOI: 10.1080/10556780310001634109     Document Type: Conference Paper

References (13)

1. N.K. Karmarkar (1984). A new polynomial-time algorithm for linear programming. Combinatorica, 4, 373-395.
2. C. Roos, T. Terlaky and J.-Ph. Vial (1997). Theory and Algorithms for Linear Optimization, An Interior Approach. John Wiley & Sons, Chichester, UK.
3. S.J. Wright (1997). Primal-Dual Interior-Point Methods. SIAM, Philadelphia, USA.
4. Y. Ye (1997). Interior Point Algorithms, Theory and Analysis. John Wiley & Sons, Chichester, UK.
5. J. Peng, C. Roos and T. Terlaky (2001). New and efficient large-update interior-point method for linear optimization. Journal of Computational Technologies, 4, 61-80.
6. J. Peng, C. Roos and T. Terlaky (2002). Self-regular functions and new search directions for linear and semi-definite optimization. Mathematical Programming, 93, 129-171.
7. J. Peng, C. Roos and T. Terlaky (2002). Self-Regularity: A New Paradigm for Primal-Dual Interior-Point Algorithms. Princeton University Press.
8. QirongMiao (2002). Implementation of the new interior-point methods. Master Thesis, September, 2002, McMaster University.
9. Xiaohang Zhu (2002). Implementing the new self-regular proximity based IPMs. Master Thesis, June, 2002, McMaster University.
10. Mehrotra (1992). On the implementation of a primal-dual interior point method. SIAM Journal on Optimization, 2, 575-601.
11. Xingsi Li (1992). An entropy-based aggregate method for min-max optimization. Engineering Optimization, 18, 277-285.
12. J. Peng, C. Roos and T. Terlaky. A new class of polynomial prima-dual methods for linear and semidefinite optimization. Manuscript.
13. Y. Zhang (1999). User's guide to Lipsol: linear-programming interior point solvers V 0.4. Interior point methods. Optimization Methods and Software, 12, 385-396.