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

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

Publisher： Taylor & Francis Ltd

ISSN： 1055-6788

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

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

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

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

Use of quadratic models with mesh-adaptive direct search for constrained black box optimization

By Conn Andrew R. Le Digabel Sébastien

Optimization Methods and Software, Vol. 28, Iss. 1, 2013-02 ,pp. : 139-158

Taylor & Francis Ltd

Access to resources Recommend Favorite

Perturbing the Dual Feasible Region for Solving Convex Quadratic Programs

By Fang S.C. Tsao H.S.J.

Journal of Optimization Theory and Applications, Vol. 94, Iss. 1, 1997-07 ,pp. : 73-85

Springer Publishing Company

Access to resources Recommend Favorite

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