Abstract:
This is a survey of the results concerning the development and study of the interior point algorithms. Some families of the direct and dual algorithms are considered. These algorithms entering the domain of feasible solutions take into account the objective function, which makes it possible to obtain the first feasible solution close to the optimal solution. The main results on the theoretical justification of algorithms are given. Recommendations are proposed concerning the advantages of individual variants of algorithms on the basis of the obtained theoretical results, available experimental studies, and experience of using algorithms in the models of energy engineering. Some numerically efficient version of the polynomial optimization algorithm in the cone of the central path is also presented.
Keywords:
interior point method, relative interior, central path, linear programming.
Citation:
V. I. Zorkaltsev, I. V. Mokryi, “Interior point algorithms in linear optimization”, Sib. Zh. Ind. Mat., 21:1 (2018), 11–20; J. Appl. Industr. Math., 12:1 (2018), 191–199
This publication is cited in the following 3 articles:
N. A. Olkhovsky, L. B. Sokolinsky, “Surface Movement Method for Linear Programming”, Lobachevskii J Math, 45:10 (2024), 5172
W. Liu, L. Yang, B. Yu, “A lifting-penalty method for quadratic programming with a quadratic matrix inequality constraint”, Mathematics, 8:2 (2020), 153
Aleksandr Domyshev, Denis Sidorov, Daniil Panasetsky, Yonghui Sun, Ping Ju, Feng Wu, 2018 2nd IEEE Conference on Energy Internet and Energy System Integration (EI2), 2018, 1