Abstract
First-order predictor-corrector methods working in a large neighborhood of the central path are among the most efficient interior point methods. In Peng et al. (SIAM J. Optim. 15(4):1105–1127, 2005), based on a specific proximity function, a wide neighborhood of the central path is defined which matches the standard large neighborhood defined by the infinity norm. In this paper, we extend the predictor-corrector algorithm proposed for linear optimization in Peng et al. (SIAM J. Optim. 15(4):1105–1127, 2005) to P ∗(κ)-linear complementarity problems. Our algorithm performs two kinds of steps. In corrector steps, we use the specific self-regular proximity function to compute the search directions. The predictor step is the same as the predictor step of standard predictor-corrector method in the interior point method literature. We prove that our predictor-corrector algorithm has an \({\mathcal {O}}\left ((1+2\kappa )\sqrt {n}\log n\log \frac {(x^{0})^{T} s^{0}}{\epsilon }\right )\) iteration bound, which is the best known iteration complexity for problems of this type.
Similar content being viewed by others
![](https://media.springernature.com/w215h120/springer-static/image/art%3A10.1007%2Fs40305-017-0178-y/MediaObjects/40305_2017_178_Figa_HTML.gif)
References
Bai, Y.Q., El Ghami, M., Roos, C.: A new efficient large-update primal-dual interior-point method based on a finite barrier. SIAM J. Optim. 13(3), 766–782 (2003)
Jansen, B., Roos, C., Terlaky, T., Ye, Y.: Improved complexity using high-order corrections for primal-dual Dikin affine scaling. Math. Program., Series B 76, 117–130 (1997)
Kojima, M., Megiddo, N., Noma, T., Yoshise, A.: A unified approach to interior point algorithms for linear complementarity problems. Lecture Notes in Computer Science, vol. 538. Springer-Verlag, Berlin (1991)
Lesaja, G., Roos, C.: Unified analysis of kernel-based interior point methods for P ∗(κ)-linear complementarity problems. SIAM J. Optim. 20(6), 3011–3039 (2010)
Mizuno, S., Todd, M.J., Ye, Y.: On adaptive-step primal-dual interior point algorithms for linear programming. Math. Oper. Res. 18, 964–981 (1993)
Peng, J., Roos, C., Terlaky, T.: Self-Regularity: A New Paradigm for Primal-Dual interior-Point Algorithms. Princeton University Press, Princeton, NJ (2002)
Peng, J., Roos, C., Terlaky, T.: Self regular functions and new search directions for linear and semidefinite optimization. Math. Program. Series A 93, 129–171 (2002)
Peng, J., Terlaky, T., Zhao, Y.: A predictor-corrector algorithm for linear optimization based on a specific self-regular proximity function. SIAM J. Optim. 15(4), 1105–1127 (2005)
Renegar, J.: A mathematical view of interior point methods in convex optimization. MPS/ SIAM Ser. Optim. 3, SIAM, Philadelphia, 2001 62, 537–551 (1993)
Stoer, J., Wechs, M.: The complexity of high-order predictor-corrector methods for solving sufficient linear complementarity problems. Optim. Methods Softw. 10, 393–417 (1998)
Väliaho, H.: P ∗-matrices are just sufficient. Linear Algebra Appl. 239, 103–108 (1996)
Ye, Y., Anstreicher, K.: On quadratic and \(O(\sqrt {n}L)\) convergence of a predictor-corrector algorithm for LCP. Math. Program., Series A 62, 537–551 (1993)
Zhongyi, L., Wenyu, S.: An infeasible interior-point algorithm with full-Newton step for linear optimization. Numer. Algorithms 46, 173–188 (2007)
Acknowledgments
The authors are grateful to two the anonymous referees and the editors for their constructive comments and suggestions to improve the presentation.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Kheirfam, B., Ahmadi, K. A Predictor-Corrector Algorithm for P ∗(κ)-Linear Complementarity Problems Based on a Specific Self-Regular Proximity Function. Acta Math Vietnam 41, 103–120 (2016). https://doi.org/10.1007/s40306-014-0100-1
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s40306-014-0100-1
Keywords
- Predictor-corrector algorithm
- Self-regular functions
- Linear complementarity problems
- Polynomial complexity