Abstract
AbstractWe propose new short-step interior-point algorithms (IPAs) for solving $$P_*(\kappa )$$
P
∗
(
κ
)
-linear complementarity problems (LCPs). In order to define the search directions, we use the algebraic equivalent transformation (AET) technique of the system describing the central path. A novelty of the paper is that we introduce a whole, new class of AET functions for which a unified complexity analysis of the IPAs is presented. This class of functions differs from the ones used in the literature for determining search directions, like the class of concave functions determined by Haddou, Migot and Omer, self-regular functions, eligible kernel and self-concordant functions. We prove that the IPAs using any member $$\varphi $$
φ
of the new class of AET functions have polynomial iteration complexity in the size of the problem, in starting point’s duality gap, in the accuracy parameter and in the parameter $$\kappa $$
κ
.
Funder
Ministry of Culture and Innovation of Hungary from the National Research, Development and Innovation Fund
Ministry for Culture and Innovation from the source of the National Research, Development and Innovation
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Management Science and Operations Research,Control and Optimization
Reference38 articles.
1. Asadi, S., Mahdavi-Amiri, N., Darvay, Z., Rigó, P.R.: Full-NT step feasible interior-point algorithm for symmetric cone horizontal linear complementarity problem based on a positive-asymptotic barrier function. Optim. Methods Softw. 3, 192–213 (2022)
2. Asadi, S., Mansouri, H.: Polynomial interior-point algorithm for $${P}_*(\kappa )$$ horizontal linear complementarity problems. Numer. Algorithms 63, 385–398 (2013)
3. Bai, Y.Q., El Ghami, M., Roos, C.: A comparative study of kernel functions for primal-dual interior-point algorithms in linear optimization. SIAM J. Optim. 15, 101–128 (2004)
4. Chung, S.-J.: NP-completeness of the linear complementarity problem. J. Optim. Theory Appl. 60, 393–399 (1989)
5. Cottle, R.W., Pang, J.-S., Stone, R.E.: The Linear Complementarity Problem. Computer Science and Scientific Computing. Academic Press, Boston (1992)
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献