Please use this identifier to cite or link to this item:
https://doi.org/10.1007/BF01585931
| Title: | The curvature integral and the complexity of linear complementarity problems | Authors: | Zhao, G. Zhu, J. |
Keywords: | Central trajectory Complexity analysis Curvature integral Interior-point methods Linear complementarity problem Predictor-corrector algorithm |
Issue Date: | Oct-1995 | Citation: | Zhao, G., Zhu, J. (1995-10). The curvature integral and the complexity of linear complementarity problems. Mathematical Programming 70 (1-3) : 107-122. ScholarBank@NUS Repository. https://doi.org/10.1007/BF01585931 | Abstract: | In this paper, we propose a predictor-corrector-type algorithm for solving the linear complementarity problem (LCP), and prove that the actual number of iterations needed by the algorithm is bounded from above and from below by a curvature integral along the central trajectory of the problem. This curvature integral is not greater than, and possibly smaller than, the best upper bound obtained in the literature to date. © 1995 The Mathematical Programming Society, Inc. | Source Title: | Mathematical Programming | URI: | http://scholarbank.nus.edu.sg/handle/10635/104276 | ISSN: | 00255610 | DOI: | 10.1007/BF01585931 |
| Appears in Collections: | Staff Publications |
Show full item record
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.