Kernel function-based interior-point algorithms for linear optimisation
by Bachir Bounibane; El Amir Djeffal
International Journal of Mathematical Modelling and Numerical Optimisation (IJMMNO), Vol. 9, No. 2, 2019

Abstract: We propose a primal-dual interior-point algorithm for linear optimisation based on a class of kernel functions which is eligible. New search directions and proximity measures are defined based on these functions. We derive the complexity bounds for large and small-update methods respectively. These are currently the best known complexity results for such methods.

Online publication date: Mon, 28-Jan-2019

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Mathematical Modelling and Numerical Optimisation (IJMMNO):
Login with your Inderscience username and password:

    Username:        Password:         

Forgotten your password?


Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com