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

Author： Bai Y. Q.   Wang F. Y.   Luo X. W.  

Publisher： Edp Sciences

E-ISSN： 1290-3868|44|3|251-265

ISSN： 0399-0559

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

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 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

An interior point algorithm for convex quadratic programming withstrict equilibrium constraints

By Benouahboun Rachid   Mansouri Abdelatif  

RAIRO - Operations Research, Vol. 39, Iss. 1, 2010-03 ,pp. : 13-33

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

New results on semidefinite bounds for ℓ1-constrained nonconvex quadratic optimization∗

By Xia Yong  

RAIRO - Operations Research, Vol. 47, Iss. 3, 2013-08 ,pp. : 285-297

Edp Sciences

Access to resources Recommend Favorite