A relaxed logarithmic barrier method for semidefinite programming

Author： Samia Kettab   Djamel Benterki  

Publisher： Edp Sciences

E-ISSN： 1290-3868|49|3|555-568

ISSN： 0399-0559

Source： RAIRO - Operations Research, Vol.49, Iss.3, 2015-02, pp. : 555-568

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

A logarithm barrier method for semi-definite programming

By Crouzeix Jean-Pierre   Merikhi Bachir  

RAIRO - Operations Research, Vol. 42, Iss. 2, 2008-05 ,pp. : 123-139

Edp Sciences

Access to resources Recommend Favorite

A new barrier for a class of semidefinite problems

By Papa Quiroz Erik A.   Oliveira Paolo Roberto  

RAIRO - Operations Research, Vol. 40, Iss. 3, 2006-11 ,pp. : 303-323

Edp Sciences

Access to resources Recommend Favorite

On the central path for nonlinear semidefinite programming

By Grana Drummond L. M.   Iusem Alfredo Noel   Svaiter B. F.  

RAIRO - Operations Research, Vol. 34, Iss. 3, 2010-03 ,pp. : 331-345

Edp Sciences

Access to resources Recommend Favorite

Semidefinite Programming Based Algorithms for the Sparsest Cut Problem

By Meira Luis A.A.   Miyazawa Flávio K.  

RAIRO - Operations Research, Vol. 45, Iss. 2, 2011-06 ,pp. : 75-100

Edp Sciences

Access to resources Recommend Favorite

Semi-Definite positive Programming Relaxations for Graph Kn-Coloring in Frequency Assignment

By Meurdesoif Philippe   Rottembourg Benoît  

RAIRO - Operations Research, Vol. 35, Iss. 2, 2010-03 ,pp. : 211-228

Edp Sciences

Access to resources Recommend Favorite