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

Author： Le Thi Hoai An   Ouanes Mohand  

Publisher： Edp Sciences

E-ISSN： 1290-3868|40|3|285-302

ISSN： 0399-0559

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

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

Combination of two underestimators for univariate global optimization

By Ouanes Mohand   Chebbah Mohammed   Zidna Ahmed  

RAIRO - Operations Research, Vol. 52, Iss. 1, 2018-04 ,pp. : 177-186

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

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

Limited memory solution of bound constrained convex quadratic problems arising in video games

By Ferris Michael C.   Wathen Andrew J.   Armand Paul  

RAIRO - Operations Research, Vol. 41, Iss. 1, 2007-06 ,pp. : 19-34

Edp Sciences

Access to resources Recommend Favorite

Deterministic global optimization using interval constraint propagation techniques

By Messine Frederic  

RAIRO - Operations Research, Vol. 38, Iss. 4, 2010-03 ,pp. : 277-293

Edp Sciences

Access to resources Recommend Favorite