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):
An efficient parameterized logarithmic kernel function for linear optimization
Mousaab Bouafia, Djamel Benterki and Adnan YassineOptimization Letters 12 (5) 1079 (2018)
DOI: 10.1007/s11590-017-1170-5
See this article
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)
DOI: 10.1007/s11081-019-09436-3
See this article
A primal-dual interior point algorithm for convex quadratic programming based on a new parametric kernel function
N. Boudjellal, H. Roumili and DJ. BenterkiOptimization 1 (2020)
DOI: 10.1080/02331934.2020.1751156
See this article
An efficient twice parameterized trigonometric kernel function for linear optimization
Mousaab Bouafia and Adnan YassineOptimization and Engineering 21 (2) 651 (2020)
DOI: 10.1007/s11081-019-09467-w
See this article
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 (2020)
DOI: 10.1007/s11081-020-09516-9
See this article