Combined projected gradient algorithm for linear programming

Optimization Methods and Software

Volumn 21, Issue 4, 2006, Pages 541-550

  Li, Wei ^a   Pan, Ping Qi ^b   Chen, Guangting ^a  

^a HANGZHOU DIANZI UNIVERSITY   (China)

^b SOUTHEAST UNIVERSITY   (China)

Author keywords

Interior point method; Least squares problem; Linear programming; Pivot method; Projection; QR factorization

Indexed keywords

ALGORITHMS; CONVERGENCE OF NUMERICAL METHODS; ITERATIVE METHODS; PROBLEM SOLVING; STATISTICAL METHODS;

INTERIOR POINT METHOD; LEAST SQUARES PROBLEM; PIVOT METHOD; PROJECTION; QR FACTORIZATION;

LINEAR PROGRAMMING;

EID: 33745601655     PISSN: 10556788     EISSN: 10294937     Source Type: Journal    
DOI: 10.1080/10556780600627552     Document Type: Conference Paper

References (10)

1. Bixby, R.E., 1994, Progress in linear programming. ORSA Journal on Computing, 6, 15-22.
2. Terlaky, T. and Zhang, S., 1993, Pivot rules for linear programming: A survey on recent theoretical developments. Annals of Operations Research, 46, 203-233.
3. Illés, T. and Terlaky, T., 2002, Pivot versus interior points methods: pros and cons. European Journal of Operational Research, 140, 170-190.
4. Ye, Y. (Ed), 1997, Interior Point Algorithms (New York: John Wiley).
5. Roos, C., Terlaky, T. and Vial, J.P. (Eds), 1997, Theory and Algorithms for Linear Programming: An Interior Point Approach (New York: John Wiley).
6. Pan, P.Q., 2002, A variant of Dikin's affine-scalling algorithm for linear programming. Technical Report, Department of Mathematics, Southeast University.
7. Pan, P.Q., 1998, A basis-deficiency-allowing variation of the simplex method. Computers and Mathematics with Applications, 36, 33-53.
8. Pan, P.Q., Li, W. and Wang, Y., 2004, A phase-I algorithm using the most-obtuse-angle rule for the basis-deficiency-allowing dual simplex method. OR Transaction, 8, 88-96.
9. Pan, P.Q., 1999, A projective simplex method for linear programming. Linear Algebra and its Applications, 29, 99-125.
10. Li, W., 2004, A new method to achieve primal feasibility for linear programming. Operations Research and Management Science, 13, 7-10.