New Interior-Point Algorithm for Linear Optimization Based on a Universal Tangent Direction

W. Ai and S. Zhang, An O(√nL) iteration primal-dual path-following method, based on wide neighborhoods and large updates, for monotone LCP, SIAM J. Optim., 16 (2005), pp. 400–417.

Y. Bai, M. El Ghami, and C. Roos, A new efficient large-update primal-dual interior-point method based on a finite barrier, SIAM J. Optim., 13 (2003), pp. 766–782.

Zs. Darvay, New interior point algorithms in linear programming, Adv. Model. Optim., 5 (2003), pp. 51–92.

M. E.-Nagy, T. Illés, Yu. Nesterov, and P. Rig´o, Parabolic target space interior-point algorithms
for weighted monotone linear complementarity problem, Tech. Report 4, Corvinus Econ. Work. Paper, 2024.

M. E.-Nagy and A. Varga, A long-step interior point framework and a related function class for linear optimization, Tech. Report 1, Corvinus Econ. Work. Paper, 2024.

A. Fiacco and G. McCormick, Nonlinear Programming: Sequential Unconstrained Minimization
Techniques, John Wiley & Sons, New York, 1969.

C. Gonzaga, An algorithm for solving linear programming problems in O(n3L) operations, in
Progress in Mathematical Programming: Interior Point and Related Methods, N. Megiddo, ed., Springer Verlag, New York, 1989, pp. 1–28.

T. Illés, P. Rigó, and R. Török, Unified approach of interior-point algorithms for P∗(κ)-LCPs using a new class of algebraically equivalent transformations, J. Optim. Theory Appl., 202 (2024), pp. 27–49.

N. Karmarkar, A new polynomial-time algorithm for linear programming, Combinatorica, 4 (1984), pp. 373–395.

L. Khachiyan, A polynomial algorithm for linear programming, Soviet Math. Dokl., 20 (1979), pp. 191–194.

G. Lesaja and C. Roos, Unified analysis of kernel-based interior-point methods for P∗(κ)-
linear complementarity problems, SIAM J. Optim., 20 (2010), pp. 3014–3039.

S. Mehrotra, On the implementation of a primal-dual interior point method, SIAM J. Optim.,
2 (1992), pp. 575–601.

S. Mizuno, M. Todd, and Y. Ye, On adaptive-step primal-dual interior-point algorithms for linear programming, Math. Oper. Res., 18 (1993), pp. 964–981.

A. Nemirovski and D. Yudin, Optimization methods adapting to the significant dimension of
the problem, Automatika i Telemekhanika, 38 (1979), pp. 75–87. translated in Automation and Remote Control 38(4), 513-524, 1983.

Yu. Nesterov, Introductory Lectures on Convex Optimization, Springer, New York, 2004. 18

Yu. Nesterov, Parabolic target space and primal–dual interior-point methods, Discret. Appl. Math., 156 (2008), pp. 2079–2100. In Memory of Leonid Khachiyan (1952 - 2005).

Yu. Nesterov, Lectures on Convex Optimization, Springer Optimization and Its Applications, Springer, Switzerland, 2018.

J. Nocedal and S. Wright, Numerical Optimization, Springer, New York, 2006.

J. Peng, C. Roos, and T. Terlaky, A new class of polynomial primal-dual methods for linear and semidefinite optimization, Eur. J. Oper. Res., 143 (2002), pp. 234–256.

F. Potra, Corrector-predictor methods for monotone linear complementarity problems in a wide neighborhood of the central path, Math. Program., 111 (2008), pp. 243–272.

J. Renegar, A polynomial-time algorithm, based on Newton’s method, for linear programming, Math. Program., 40 (1988), pp. 59–93.

C. Roos, T. Terlaky, and J.-P. Vial, Interior Point Methods for Linear Optimization, Springer, New York, USA, 2005.

Gy. Sonnevend, An ”analytic center” for polyhedrons and new classes of global algorithms for linear (smooth, convex) programming, in System Modelling and Optimization: Proceedings of the 12th IFIP-Conference held in Budapest, Hungary, September 1985, A. Prékopa, J. Szelezsán, and B. Strazicky, eds., vol. 84 of Lecture Notes in Control and Information Sciences, Springer Verlag, Berlin, West-Germany, 1986, pp. 866–876.

M. Todd, Potential-reduction methods in mathematical programming, Math. Program., 76 (1997), pp. 3–45.

L. Tuncel and M. Todd, On the interplay among entropy, variable metrics and potential functions in interior-point algorithms, Comput. Optim. Appl., 8 (1997), pp. 5–19.