Complexity analysis of interior point methods for linear programming based on a parameterized kernel function
RAIRO-Oper. Res., 50 4-5 (2016) 935-949
Published online: 2016-11-03
Articles citing this article
The Citing articles tool gives a list of articles citing the current article.
The citing articles come from EDP Sciences database, as well as other publishers participating in CrossRef Cited-by Linking Program. You can set up your personal account to receive an email alert each time this article is cited by a new article (see the menu on the right-hand side of the abstract page).
Cited article:
This article has been cited by the following article(s):
A Large-update Primal-dual Interior-point Algorithm for Convex Quadratic Optimization Based on a New Bi-parameterized Bi-hyperbolic Kernel Function
Youssra Bouhenache, Wided Chikouche and Imene TouilLobachevskii Journal of Mathematics 45 (3) 992 (2024)
https://doi.org/10.1134/S1995080224600560
Interior-point algorithm for linear programming based on a new descent direction
Zaoui Billel, Benterki Djamel, Kraria Aicha and Raouache HadjerRAIRO - Operations Research 57 (5) 2473 (2023)
https://doi.org/10.1051/ro/2023127
Complexity analysis of interior point methods for convex quadratic programming based on a parameterized Kernel function
Nawel Boudjellal, Hayet Roumili and Djamel BenterkiBoletim da Sociedade Paranaense de Matemática 40 1 (2022)
https://doi.org/10.5269/bspm.47772
Novel Kernel Function With a Hyperbolic Barrier Term to Primal-dual Interior Point Algorithm for SDP Problems
Imene Touil and Wided ChikoucheActa Mathematicae Applicatae Sinica, English Series 38 (1) 44 (2022)
https://doi.org/10.1007/s10255-022-1061-0
A new primal-dual interior-point method for semidefinite optimization based on a parameterized kernel function
Mengmeng Li, Mingwang Zhang, Kun Huang and Zhengwei HuangOptimization and Engineering 22 (1) 293 (2021)
https://doi.org/10.1007/s11081-020-09516-9
A primal-dual interior point algorithm for convex quadratic programming based on a new parametric kernel function
N. Boudjellal, H. Roumili and DJ. BenterkiOptimization 70 (8) 1703 (2021)
https://doi.org/10.1080/02331934.2020.1751156
A new parameterized logarithmic kernel function for linear optimization with a double barrier term yielding the best known iteration bound
Benhadid Ayache and Saoudi KhaledCommunications in Mathematics 28 (1) 27 (2020)
https://doi.org/10.2478/cm-2020-0003
An efficient twice parameterized trigonometric kernel function for linear optimization
Mousaab Bouafia and Adnan YassineOptimization and Engineering 21 (2) 651 (2020)
https://doi.org/10.1007/s11081-019-09467-w
An efficient primal-dual interior point method for linear programming problems based on a new kernel function with a finite exponential-trigonometric barrier term
S. Fathi-Hafshejani, M. Reza Peyghami and A. Fakharzadeh JahromiOptimization and Engineering 21 (1) 107 (2020)
https://doi.org/10.1007/s11081-019-09436-3
An efficient parameterized logarithmic kernel function for linear optimization
Mousaab Bouafia, Djamel Benterki and Adnan YassineOptimization Letters 12 (5) 1079 (2018)
https://doi.org/10.1007/s11590-017-1170-5