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

Author： Ferris Michael C.   Wathen Andrew J.   Armand Paul  

Publisher： Edp Sciences

E-ISSN： 1290-3868|41|1|19-34

ISSN： 0399-0559

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

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

Rescaled proximal methods for linearly constrained convex problems

By Silva Paulo J.S.   Humes Carlos  

RAIRO - Operations Research, Vol. 41, Iss. 4, 2007-10 ,pp. : 367-380

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

Playing Video Games While Using or Feeling the Effects of Substances: Associations with Substance Use Problems

By Ream Geoffrey L.   Elliott Luther C.   Dunlap Eloise  

International Journal of Environmental Research and Public Health, Vol. 8, Iss. 10, 2011-10 ,pp. : 3979-3998

MDPI

Access to resources Recommend Favorite

Solution of a dual integral equation arising in the contact problems of elasticity theory with the full Fourier series as the right-hand side

By  

MATEC Web of conference, Vol. 132, Iss. issue, 2017-10 ,pp. : 03011-03011

Edp Sciences

Access to resources Recommend Favorite

Quadratic 0–1 programming: Tightening linear or quadratic convex reformulation by use of relaxations

By Billionnet Alain   Elloumi Sourour   Plateau Marie-Christine  

RAIRO - Operations Research, Vol. 42, Iss. 2, 2008-05 ,pp. : 103-121

Edp Sciences

Access to resources Recommend Favorite