A new finite continuation algorithm for linear programming

SIAM Journal on Optimization

Volumn 6, Issue 3, 1996, Pages 600-616

  Madsen, Kaj ^a   Nielsen, Hans Bruun ^b   Pinar, Mustafa Ç ^b  

^a TECHNICAL UNIVERSITY OF DENMARK   (Denmark)

^b BILKENT UNIVERSITY   (Turkey)

Author keywords

Continuation methods; Finite algorithms; Huber function; Linear programming; Newton's method; 1optimization

Indexed keywords

EID: 0030303852     PISSN: 10526234     EISSN: None     Source Type: Journal    
DOI: 10.1137/S1052623493258556     Document Type: Article

References (21)

1. R. H. BARTELS (1980), A penalty linear programming method using reduced-gradient basis-exchange techniques, Linear Algebra Appl., 29, pp. 17-32.
2. B. CHEN AND P.T. HARKER (1993), A non-interior continuation algorithm for linear and quadratic programming, SIAM J. Optim., 3, pp. 503-515.
3. T. COLEMAN AND Y. LI (1990), A globally and quadratically convergent affine scaling algorithm for the linear programming problem with bounded variables, in Large Scale Numerical Optimization, T. Coleman and Y. Li, eds., Society for Industrial and Applied Mathematics, Philadelphia, PA, pp. 49-57.
4. 1 problems, Math. Programming, 56, pp. 189-222.
5. A. R. CONN (1976), Linear programming via a nondifferentiable penalty function, SIAM J. Numer. Anal., 13, pp. 145-154.
6. T factorizations, Math. Comp., 28, pp. 1067-1087.
7. D. M. GAY (1985), Electronic mail distribution of linear programming test problems, Math. Prog. Soc. COAL Newsletter, 13, pp. 10-12.
8. W. M. GENTLEMAN (1973), Least squares computation by Givens transformations without square roots, J. Inst. Math. Appl., 12, pp. 329-336.
9. P. E. GILL, S. HAMMARLING, W. MURRAY, M. A. SAUNDERS, AND M. H. WRIGHT (1986), User's Guide for LSSOL (Version 1.0): A Fortran Package for Constrained Linear Least Squares and Convex Quadratic Programming, Report SOL 86-1, Department of Operations Research, Stanford University, Stanford, CA.
10. P. HUBER (1981), Robust Statistics, John Wiley, New York.
11. I. LUSTIG, R. MARSTEN, AND D. SHANNO (1991), Computational experience with a primal-dual interior point method for linear programming, Linear Algebra Appl., 152, pp. 191-222.
12. K. MADSEN AND H.B. NIELSEN (1990), Finite algorithms for robust linear regression, BIT, 30, pp. 682-699.
13. 1 estimation, SIAM J. Optim., 3, pp. 223-235.
14. 1 Optimization, Report NI-92-11, Institute of Mathematical Modelling, Numerical Analysis Group, Technical University of Denmark, Lyngby, Denmark.
15. 1 solutions to overdetermined linear systems, Oper. Res. Lett., 16, 3, pp. 159-166.
16. _ (1994), User's Guide to LPASL1: A Fortran 77 Subroutine, Based on a Continuation Algorithm, for Dense Linear Programming, Report IMM-94-01, Institute of Mathematical Modelling, Numerical Analysis Group, Technical University of Denmark, Lyngby, Denmark.
17. TAx = c, Report NI-90-11, Institute of Mathematical Modelling, Numerical Analysis Group, Technical University of Denmark, Lyngby, Denmark.
18. 1 Estimation, Report NI-91-01, Institute of Mathematical Modelling, Numerical Analysis Group, Technical University of Denmark, Lyngby, Denmark.
19. M. Ç. PINAR AND S. A. ZENIOS (1994), On smoothing exact penalty functions for convex constrained optimization, SIAM J. Optim., 4, pp. 486-511.
20. T. ROCKAFELLAR (1990), Computational schemes for large-scale problems in extended linear-quadratic programming, Math. Programming, 48, pp. 447-474.
21. J. SUN (1992), On the structure of convex piecewise quadratic functions, J. Optim. Theory Appl., 72, pp. 499-510.