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

E-ISSN： 1290-3868|47|3|285-297

ISSN： 0399-0559

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

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

On semidefinite bounds for maximization of a non-convex quadraticobjective over the l₁ unit ball

By Pinar Mustafa Ç. Teboulle Marc

RAIRO - Operations Research, Vol. 40, Iss. 3, 2006-11 ,pp. : 253-265

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

Convex quadratic underestimation and Branch and Bound for univariate global optimization with one nonconvex constraint

By Le Thi Hoai An Ouanes Mohand

RAIRO - Operations Research, Vol. 40, Iss. 3, 2006-11 ,pp. : 285-302

Edp Sciences

Access to resources Recommend Favorite

A New Optimization Model for the Sustainable Development: Quadratic Knapsack Problem with Conflict Graphs

By Shi Xiaochuan Wu Lei Meng Xiaoliang

Sustainability, Vol. 9, Iss. 2, 2017-02 ,pp. : 236-236

MDPI

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