Complexity analysis of interior point methods for linear programming based on a parameterized kernel function

Author： Bouafia Mousaab   Benterki Djamel   Yassine Adnan  

Publisher： Edp Sciences

E-ISSN： 1290-3868|50|4-5|935-949

ISSN： 0399-0559

Source： RAIRO - Operations Research, Vol.50, Iss.4-5, 2016-11, pp. : 935-949

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

Generic Primal-dual Interior Point Methods Based on a New Kernel Function

By EL Ghami M.   Roos C.  

RAIRO - Operations Research, Vol. 42, Iss. 2, 2008-05 ,pp. : 199-213

Edp Sciences

Access to resources Recommend Favorite

Primal-dual entropy-based interior-point algorithms for linear optimization

By Karimi Mehdi   Luo Shen   Tunçel Levent  

RAIRO - Operations Research, Vol. 51, Iss. 2, 2017-02 ,pp. : 299-328

Edp Sciences

Access to resources Recommend Favorite

Complexity analysis of a weighted-full-Newton step interior-point algorithm for P∗(κ)-LCP

By Achache Mohamed  

RAIRO - Operations Research, Vol. 50, Iss. 1, 2016-01 ,pp. : 131-143

Edp Sciences

Access to resources Recommend Favorite

A numerical feasible interior point method for linear semidefiniteprograms

By Benterki Djamel   Crouzeix Jean-Pierre   Merikhi Bachir  

RAIRO - Operations Research, Vol. 41, Iss. 1, 2007-06 ,pp. : 49-59

Edp Sciences

Access to resources Recommend Favorite

Kernel-function Based Primal-Dual Algorithms for P*(κ) Linear Complementarity Problems

By EL Ghami M.   Steihaug T.  

RAIRO - Operations Research, Vol. 44, Iss. 3, 2010-07 ,pp. : 185-205

Edp Sciences

Access to resources Recommend Favorite