An Efficient Algorithm for Solving Convex–Convex Quadratic Fractional Programs

By Yamamoto R.   Konno H.  

Journal of Optimization Theory and Applications, Vol. 133, Iss. 2, 2007-05 ,pp. : 241-255

Springer Publishing Company

Access to resources Recommend Favorite

Certification aspects of the fast gradient method for solving the dual of parametric convex programs

By Richter Stefan   Jones Colin   Morari Manfred  

Mathematical Methods of Operations Research, Vol. 77, Iss. 3, 2013-06 ,pp. : 305-321

Springer Publishing Company

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

Convex quadratic relaxations of nonconvex quadratically constrained quadratic programs

By Mitchell John E.   Pang Jong-Shi   Yu Bin  

Optimization Methods and Software, Vol. 29, Iss. 1, 2014-01 ,pp. : 120-136

Taylor & Francis Ltd

Access to resources Recommend Favorite

An efficient compact quadratic convex reformulation for general integer quadratic programs

By Billionnet Alain  

Computational Optimization and Applications, Vol. 54, Iss. 1, 2013-01 ,pp. : 141-162

Springer Publishing Company

Access to resources Recommend Favorite