×

A Mizuno-Todd-Ye type predictor-corrector algorithm for sufficient linear complementarity problems. (English) Zbl 1123.90347


MSC:

90C33 Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming)
90C05 Linear programming
90C51 Interior-point methods
Full Text: DOI

References:

[1] Cottle, R. W.; Pang, J.-S.; Venkateswaran, V., Sufficient matrices and the linear complementarity problem, Linear Algebra and its Applications, 114/115, 231-249 (1989) · Zbl 0674.90092
[2] Guu, S.-M.; Cottle, R. W., On a subclass of \(P_0\), Linear Algebra and its Applications, 223/224, 325-335 (1995) · Zbl 0831.15013
[3] Illés, T.; Roos, C.; Terlaky, T., Polynomial affine-scaling algorithms for \(P_∗(κ)\) linear complementarity problems, (Gritzmann, P.; Horst, R.; Sachs, E.; Tichatschke, R., Recent Advances in Optimization, Proceedings of the 8th French-German Conference on Optimization, Trier, July 21-26, 1996. Recent Advances in Optimization, Proceedings of the 8th French-German Conference on Optimization, Trier, July 21-26, 1996, Lecture Notes in Economics and Mathematical Systems, vol. 452 (1997), Springer-Verlag: Springer-Verlag Berlin), 119-137 · Zbl 0914.90251
[4] Ji, J.; Potra, F. A.; Sheng, R., A predictor-corrector method for the \(P_∗\)-matrix LCP from infeasible starting points, Optimization Methods and Software, 6, 109-126 (1995)
[5] Kojima, M.; Mizuno, S.; Yoshise, A., A polynomial-time algorithm for a class of linear complementarity problems, Mathematical Programming, 44, 1-26 (1989) · Zbl 0676.90087
[6] Kojima, M.; Megiddo, N.; Noma, T.; Yoshise, A., A Unified Approach to Interior Point Algorithms for Linear Complementarity Problems. A Unified Approach to Interior Point Algorithms for Linear Complementarity Problems, Lecture Notes in Computer Science, vol. 538 (1991), Springer-Verlag: Springer-Verlag Berlin, Germany · Zbl 0745.90069
[7] Miao, J., A quadratically convergent \(O((\kappa + 1) \sqrt{n} L)\)-iteration algorithm for the \(P_∗(κ)\)-matrix linear complementarity problem, Mathematical Programming, 69, 355-368 (1995) · Zbl 0844.90097
[8] Mizuno, S.; Todd, M. J.; Ye, Y., On adaptive-step primal-dual interior-point algorithms for linear programming, Mathematics of Operations Research, 18, 4, 964-981 (1993) · Zbl 0810.90091
[9] Peng, J.; Roos, C.; Terlaky, T., Self-Regularity: A New Paradigm for Primal-Dual Interior Point Algorithms (2002), Princeton University Press: Princeton University Press New Jersey, USA · Zbl 1136.90045
[10] I. Pólik, Novel analysis of interior point methods for linear optimization problems, Ms. Thesis, Eötvös Loránd University of Sciences, Faculty of Natural Sciences, Budapest, 2002 [in Hungarian]. Available from: <http://www.cs.elte.hu/matdiploma/>; I. Pólik, Novel analysis of interior point methods for linear optimization problems, Ms. Thesis, Eötvös Loránd University of Sciences, Faculty of Natural Sciences, Budapest, 2002 [in Hungarian]. Available from: <http://www.cs.elte.hu/matdiploma/>
[11] Potra, F. A.; Sheng, R., Predictor-corrector algorithm for solving \(P_∗(κ)\)-matrix LCP from arbitrary positive starting points, Mathematical Programming, 76, 1, 223-244 (1996) · Zbl 0881.90115
[12] Potra, F. A.; Sheng, R., A large step infeasible interior point method for the \(P_∗\)-matrix LCP, SIAM Journal on Optimization, 7, 2, 318-335 (1997) · Zbl 0872.90100
[13] Potra, F. A.; Sheng, R., Superlinearly convergent infeasible interior point algorithm for degenerate LCP, Journal of Optimization Theory and Application, 97, 2, 249-269 (1998) · Zbl 0907.90261
[14] Potra, F. A., The Mizuno-Todd-Ye algorithm in a larger neighborhood of the central path, European Journal of Operational Research, 143, 257-267 (2002) · Zbl 1058.90076
[15] Roos, C.; Terlaky, T.; Vial, J.-Ph., Theory and Algorithms for Linear Optimization, An Interior Point Approach. Theory and Algorithms for Linear Optimization, An Interior Point Approach, Wiley-Interscience Series in Discrete Mathematics and Optimization (1997), John Wiley & Sons: John Wiley & Sons New York, USA · Zbl 0954.65041
[16] Sonnevend, Gy.; Stoer, J.; Zhao, G., On the complexity of following the central path of linear programs by linear extrapolation, Methods of Operations Research, 63, 19-31 (1989) · Zbl 0726.90056
[17] Väliaho, H., \(P_∗\)-matrices are just sufficient, Linear Algebra and its Applications, 239, 103-108 (1996) · Zbl 0851.15015
[18] Ye, Y.; Anstreicher, K., On quadratic and \(O(\sqrt{n} L)\) convergence of a predictor-corrector algorithm for LCP, Mathematical Programming, 62, 537-551 (1993) · Zbl 0799.90111
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.