Multiterm polyhedral relaxations for nonconvex, quadratically constrained quadratic programs

By Bao Xiaowei   Sahinidis Nikolaos   Tawarmalani Mohit  

Optimization Methods and Software, Vol. 24, Iss. 4-5, 2009-08 ,pp. : 485-504

Taylor & Francis Ltd

Access to resources Recommend Favorite

A compact variant of the QCR method for quadratically constrained quadratic 0–1 programs

By Galli Laura   Letchford Adam  

Optimization Letters, Vol. 8, Iss. 4, 2014-04 ,pp. : 1213-1224

Springer Publishing Company

Access to resources Recommend Favorite

A Smoothing Newton-Type Algorithm of Stronger Convergence for the Quadratically Constrained Convex Quadratic Programming

By Huang Zheng-Hai   Sun Defeng   Zhao Gongyun  

Computational Optimization and Applications, Vol. 35, Iss. 2, 2006-10 ,pp. : 199-237

Springer Publishing Company

Access to resources Recommend Favorite

Dynamically generated cutting planes for mixed-integer quadratically constrained quadratic programs and their incorporation into GloMIQO 2

By Misener Ruth   Smadbeck James B.   Floudas Christodoulos A.  

Optimization Methods and Software, Vol. 30, Iss. 1, 2015-01 ,pp. : 215-249

Taylor & Francis Ltd

Access to resources Recommend Favorite

Solving the canonical dual of box- and integer-constrained nonconvex quadratic programs via a deterministic direct search algorithm

By Gao David Yang   Watson Layne T.   Easterling David R.   Thacker William I.   Billups Stephen C.  

Optimization Methods and Software, Vol. 28, Iss. 2, 2013-04 ,pp. : 313-326

Taylor & Francis Ltd

Access to resources Recommend Favorite