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

Author： Karimi Mehdi   Luo Shen   Tunçel Levent  

Publisher： Edp Sciences

E-ISSN： 1290-3868|51|2|299-328

ISSN： 0399-0559

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

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

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

Primal-dual approximation algorithms for a packing-covering pair of problems

By Kovaleva Sofia   Spieksma Frits C.R.  

RAIRO - Operations Research, Vol. 36, Iss. 1, 2010-03 ,pp. : 53-71

Edp Sciences

Access to resources Recommend Favorite

A Polynomial-time Interior-point Algorithm for Convex QuadraticSemidefinite Optimization

By Bai Y. Q.   Wang F. Y.   Luo X. W.  

RAIRO - Operations Research, Vol. 44, Iss. 3, 2010-10 ,pp. : 251-265

Edp Sciences

Access to resources Recommend Favorite

A full NT-step infeasible interior-point algorithm for semidefinite optimization

By Pirhaji Mohammad   Mansouri Hosseino   Zangiabadi Maryam  

RAIRO - Operations Research, Vol. 51, Iss. 3, 2017-06 ,pp. : 533-545

Edp Sciences

Access to resources Recommend Favorite