Abstract
Following the central-path, as a guide line to optimal solution of mathematical problems, is one of the main difficulty of interior-point methods in practice. These iterative methods, follow the central path step by step to get close enough to the optimal solution of underlying problem. Based on estimating the central path by an ellipse, we propose an infeasible interior-point method for linear complementarity problem. In each iteration, the algorithm follows the ellipsoidal approximation of the central-path to find an \(\varepsilon \)-approximate solution of the problem. We prove that under certain conditions the proposed algorithm is well-defined and the generated points by the algorithm converge to an \(\varepsilon \)-approximate solution of the linear complementarity problem.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Do Carmo, M.P.: Differential Geometry of Curves and Surfaces. Prentice-Hall, New Jersey (1976)
Jansen, B., Roos, C., Terlaky, T., Ye, Y.: Improved complexity using higher-order correctors for primal-dual dikin affine scaling. Math. Program. 76, 17–130 (1996)
Karmarkar, N.: New polynomial-time algorithm for linear programming. Combinattorica 4, 373–395 (1984)
Kojima, M., Mizuno, S., Yoshise, A.: A primal-dual interior point algorithm for linear programming. In: Megiddo, N. (ed.) Progress in Mathematical Programming: Interior Point and Related Methods, pp. 29–47. Springer Verlag, New York (1989)
Kojima, M., Megiddo, N., Noma, T., Yoshise, A.: A Unified Approach to Interior Point Algorithms for Linear Complementarity Problems. Lecture Notes in Computer Science. Springer-Verlag, Berlin (1991)
Kojima, M., Megiddo, N., Noma, T., Yoshise, A.: A unified approach to interior point algorithms for linear complementarity problems, Lec. Notes in Comp. Sci., vol. 538. Springer-Verlag, New York (1991)
Liu, H., Liu, X., Liu, C.: Mehrotra-type predictor-corrector algorithms for sufficient linear complementarity problem. Appl. Numer. Math. 62, 1685–1700 (2012)
Li, W., Zhang, M., Zhou, Y.: A Mehrotra-type predictor-corrector algorithm for \(P_{*}(\kappa )\)-linear complementarity problems. J. Math. Res. Appl. 3, 297–312 (2012)
Cadou, J.M., Zahrouni, H., Damil, N., Potier-Ferry, M., Lahmam, H.: High-order predictor-corrector algorithms. Int. J. Numer. Methods Eng. 55, 685–704 (2002)
Mehrotra, S.: On the implementation of a primal-dual interior point method. SIAM J. Optim. 2, 575–601 (1992)
Potra, F.A.: A quadratically convergent predictor-corrector method for solving linear programs from infeasible starting points. Math. Program. 67, 383–406 (1994)
Potra, F.A.: An infeasible-interior-point predictor-corrector algorithm for linear programming. SIAM J. Optim. 6, 19–32 (1996)
Polyanin, A.D., Manzhirov, A.V.: Handbook of Mathematics For Engineers and Scientists. CRC Press, Boca Raton (2007)
Salahi, M., Mahdavi-Amiri, N.: Polynomial time second order Mehrotra-type predictor-corrector algorithms. Appl. Math. Comput. 183, 646–658 (2006)
Ye, Y., Tse, E.: An extension of Karmarkar projective algorithm for convex quadratic programming. Math. Program. 44, 157–179 (1989)
Yang, Y.: A polynomial arc-search interior-point algorithm for convex quadratic programming. Eur. J. Oper. Res. 215, 25–33 (2011)
Yang, Y.: A polynomial arc-search interior-point algorithm for linear programming. J. Optim. Theory Appl. 158, 859–873 (2013)
Yang, Y.: Curve LP-A MATLAB implementation of an infeasible interior-point algorithm for linear programming. Numer. Algor. 74, 957–996 (2017)
Yang, Y.: Two computationally efficient polynomial-iteration infeasible interior-point algorithms for linear programming, Numer. Algor. https://doi.org/10.1007/s11075-018-0469-3
Acknowledgements
The authors thank Shahrekord University for the financial support. The authors were also partially supported by the Center of Excellence for Mathematics, University of Shahrekord, Shahrekord, Iran.
Author information
Authors and Affiliations
Corresponding author
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
About this article
Cite this article
Pirhaji, M., Zangiabadi, M. & Mansouri, H. On the convergence analysis of arc search interior point methods for LCPs. Afr. Mat. 30, 999–1009 (2019). https://doi.org/10.1007/s13370-019-00697-w
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s13370-019-00697-w