- W. Ai, S. Zhang, An O\((\sqrt{n}{L})\) iteration primal–dual path-following method, based on wide neighborhoods and large updates, for monotone LCP. SIAM J. Optim. 16, 400–417 (2005)
Article MathSciNet Google Scholar
- Z. Darvay, New interior point algorithms in linear programming. Adv. Model. Optim. 5, 51–92 (2003)
MathSciNet Google Scholar
- Z. Darvay, T. Illés, B. Kheirfam, P. Rigó, A corrector–predictor interior-point method with new search direction for linear optimization. Cent. Eur. J. Oper. Res. 28, 1123–1140 (2020)
Article MathSciNet Google Scholar
- Z. Darvay, T. Illés, J. Povh, P.R. Rigó, Feasible corrector–predictor interior-point algorithm for \({P}_{*} (\kappa )\)-linear complementarity problems based on a new search direction. SIAM J. Optim. 30, 2628–2658 (2020)
Article MathSciNet Google Scholar
- Z. Darvay, B. Kheirfam, P.R. Rigó, A new wide neighborhood primal–dual second-order corrector algorithm for linear optimization. Optim. Lett. 14, 1747–1763 (2020)
Article MathSciNet Google Scholar
- Z. Darvay, I.M. Papp, P.R. Takács, Complexity analysis of a full-newton step interior-point method for linear optimization. Period. Math. Hungar. 73, 27–42 (2016)
Article MathSciNet Google Scholar
- Z. Darvay, P.R. Takács, Large-step interior-point algorithm for linear optimization based on a new wide neighbourhood. Cent. Eur. J. Oper. Res. 26, 551–563 (2018)
Article MathSciNet Google Scholar
- M. E.-Nagy, A. Varga, A new long-step interior point algorithm for linear programming based on the algebraic equivalent transformation. Cent. Eur. J. Oper. Res. (2022)
- Z. Feng, A new iteration large-update primal–dual interior-point method for second-order cone programming. Numer. Funct. Anal. Optim. 33, 397–414 (2012)
Article MathSciNet Google Scholar
- Z. Feng, L. Fang, A new O\((n{L})\)-iteration predictor–corrector algorithm with wide neighborhood for semidefinite programming. J. Comput. Appl. Math. 256, 65–76 (2014)
Article MathSciNet Google Scholar
- N. Karmarkar, A new polynomial-time algorithm for linear programming. Combinatorica 4, 373–395 (1984)
Article MathSciNet Google Scholar
- B. Kheirfam, A new search direction for full-newton step interior-point method in P\(_*(\kappa )\)-HLCP. Numer. Funct. Anal. Optim. 40, 1169–1181 (2019)
Article MathSciNet Google Scholar
- B. Kheirfam, A new wide neighbourhood primal–dual interior-point algorithm for semidefinite optimization. Optimization 68, 1–21 (2019)
Article MathSciNet Google Scholar
- B. Kheirfam, An interior-point method for symmetric optimization based on a new wide neighborhood. Pac. J. Optim. 16, 625–640 (2020)
MathSciNet Google Scholar
- B. Kheirfam, M. Chitsaz, A new second-order corrector interior-point algorithm for P\(_*(\kappa )\)-LCP. Filomat 31, 6379–6391 (2017)
Article MathSciNet Google Scholar
- B. Kheirfam, M. Haghighi, A wide neighborhood interior-point algorithm for linear optimization based on a specific kernel function. Period. Math. Hungar. 79, 94–105 (2018)
Article MathSciNet Google Scholar
- B. Kheirfam, N. Hosseinpour, H. Abedi, A new corrector–predictor interior-point method for symmetric cone optimization. Period. Math. Hungar. 85, 1–16 (2022)
Article MathSciNet Google Scholar
- B. Kheirfam, A second-order corrector infeasible interior-point method with one-norm wide neighborhood for symmetric optimization. Fundamenta Informaticae 172, 343–359 (2020)
Article MathSciNet Google Scholar
- B. Kheirfam, M. Chitsaz, Polynomial convergence of two higher order interior-point methods for P\(_*(\kappa )\)-LCP in a wide neighborhood of the central path. Period. Math. Hungar. 76, 243–264 (2018)
Article MathSciNet Google Scholar
- B. Kheirfam, M. Haghighi, A full-newton step feasible interior-point algorithm for \({P}_*(\kappa )\)-LCP based on a new search direction. Croat. Oper. Res. Rev. 66, 277–290 (2016)
Article MathSciNet Google Scholar
- B. Kheirfam, A. Nasrollahi, M. Mohammadi, A second-order corrector infeasible interior-point method for semidefinite optimization based on a wide neighborhood. J. Sci. Comput. 86, 66 (2021)
Article MathSciNet Google Scholar
- Y. Li, T. Terlaky, A new class of large neighborhood path-following interior point algorithms for semidefinite optimization with O\((\sqrt{n}\log \frac{Tr(X^0S^0)}{\epsilon }{L})\) iteration complexity. SIAM J. Optim. 20, 2853–2875 (2010)
Article MathSciNet Google Scholar
- C. Liu, H. Liu, A new second-order corrector interior-point algorithm for semidefinite programming. Math. Methods Oper. Res. 75, 165–183 (2012)
Article ADS MathSciNet Google Scholar
- C. Liu, H. Liu, W. Cong, An O\((\sqrt{n}{L})\) iteration primal–dual second-order corrector algorithm for linear programming. Optim. Lett. 5, 729–743 (2011)
Article MathSciNet Google Scholar
- H. Mansouri, M. Pirhaji, A polynomial interior-point algorithm for monotone linear complementarity problems. J. Optim. Theory Appl. 157, 451–461 (2013)
Article MathSciNet Google Scholar
- F.A. Potra, Interior point methods for sufficient horizontal LCP in a wide neighborhood of the central path with best known iteration complexity. SIAM J. Optim. 24, 1–28 (2014)
Article MathSciNet Google Scholar
- C. Roos, T. Terlaky, J.P. Vial, Interior Point Methods for Linear Optimization (Springer, Berlin, 2005)
Google Scholar
- M.S. Shahraki, H. Mansouri, M. Zangiabadi, A new wide neighborhood primal–dual predictor–corrector interior-point method for linear programming. Numer. Funct. Anal. Optim. 37, 628–639 (2016)
Article MathSciNet Google Scholar
- S.J. Wright, Primal–Dual Interior-Point Methods, vol. 54 (SIAM, Philadelphia, 1997)
Book Google Scholar
- Y. Ye, Interior Point Algorithms: Theory and Analysis (Springer, Berlin, 1997)
Book Google Scholar
- Y. Ye, M.J. Todd, S. Mizuno, An O\((\sqrt{n}{L})\)-iteration homogeneous and self-dual linear programming algorithm. Math. Oper. Res. 19, 53–67 (1994)
Article MathSciNet Google Scholar