Improved smoothing-type methods for the solution of linear programs

Numerische Mathematik

Volumn 90, Issue 3, 2002, Pages 487-507

  Engelke, Stephan ^a   Kanzow, Christian ^a  

^a UNIVERSITY OF HAMBURG   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0036002580     PISSN: 0029599X     EISSN: None     Source Type: Journal    
DOI: 10.1007/s002110100301     Document Type: Article

References (20)

1. J.V. Burke, S. Xu: A non-interior predictor-corrector path-following method for LCP. In: M. Fukushima, L. Qi (eds.): Reformulation: Nonsmooth, Piecewise Smooth, Semismooth and Smoothing Methods. Kluwer: Kluwer Academic Publishers 1999
2. J.V. Burke, S. Xu: A non-interior-predictor-corrector path following algorithm for the monotone linear complementarity problem. Mathematical Programming 87, 113-130 (2000)
3. 0 NCP or monotone NCR SIAM J. Opt. 9, 624-645 (1999)
4. B. Chen, P.T. Harker: A non-interior-point continuation method for linear complementarity problems. SIAM J. Matrix Anal. Appl. 14, 1168-1190 (1993)
5. B. Chen, N. Xiu: A global linear and local quadratic noninterior continuation method for nonlinear complementarity problems based on Chen-Mangasarian smoothing functions. SIAM J. Opt. 9, 605-623 (1999)
6. X. Chen, L. Qi, D. Sun: Global and superlinear convergence of the smoothing Newton method and its application to general box constrained variational inequalities. Math. Comput. 67, 519-540 (1998)
7. X. Chen, Y. Ye: On homotopy-smoothing methods for box-constrained variational inequalities. SIAM J. Control Opt. 37, 589-616 (1999)
8. S. Engelke, C. Kanzow: On the solution of linear programs by Jacobian smoothing methods. Ann. Oper. Res. (to appear)
9. S. Engelke, C. Kanzow: Predictor-corrector smoothing methods for the solution of linear programs. Preprint 153, Institute of Applied Mathematics, University of Hamburg, Hamburg, March 2000
10. A. Fischer: A special Newton-type optimization method. Optimization 24, 269-284 (1992)
11. K. Hotta, A. Yoshise: Global convergence of a class of non-interior point algorithms using Chen-Harker-Kanzow-Smale functions for nonlinear complementarity problems. Mathematical Programming 86, 105-133 (1999)
12. H. Jiang: Smoothed Fischer-Burmeister equation methods for the complementarity problem. Technical Report, Department of Mathematics, University of Melbourne, Melbourne, Australia, June 1997
13. C. Kanzow: Some noninterior continuation methods for linear complementarity problems. SIAM J. Matrix Anal. Appl. 17, 851-868 (1996)
14. E. Ng, B.W. Peyton: Block sparse Cholesky algorithms on advanced uniprocessor computers. SIAM J. Sci. Comput. 14, 1034-1056 (1993)
15. S. Smale: Algorithms for solving equations. In Proceedings of the International Congress of Mathematicians. AMS, Providence 172-195 (1987)
16. P. Tseng: Analysis of a non-interior continuation method based on Chen-Mangasarian smoothing functions for complementarity problems. In: M. Fukushima, L. Qi (eds.): Reformuation: Nonsmooth, Piecewise Smooth, Semismooth and Smoothing Methods, pp. 381-404. Dordrecht: Kluwer Academic Publishers 1998
17. P. Tseng: Error bounds and superlinear convergence analysis of some Newton-type methods in optimization. In: G. Di Pillo, F. Giannessi (eds.): Nonlinear Optimization and Related Topics. Dordrecht: Kluwer Academic Publishers (to appear)
18. S.J. Wright: Primal-Dual Interior-Point Methods. SIAM, Philadelphia, PA, 1997
19. Y. Zhang: Solving large-scale linear programs by interior-point methods under the MATLAB environment. Opt. Methods Softw. 10, 1-31 (1998)
20. Y. Zhang: User's guide to LIPSOL: Linear programming interior point solver v0.4. Opt. Methods Softw. 11 & 12, 385-396 (1999)