Nonconvex Quadratic Programming

  • Hoang Tuy
Part of the Nonconvex Optimization and Its Applications book series (NOIA, volume 22)


As we have pointed out in the preceding chapters, in deterministic global optimization it is of utmost importance to take advantage of the particular mathematical structure of the problem under study. There are in general two aspects of nonconvexity deserving special attention. First, the rank of nonconvexity, i.e. roughly speaking, the number of nonconvex variables. In Chapter 7 we have discussed decomposition methods for handling low rank nonconvex problems. The second aspect is the degree of nonconvexity, i.e. the extent to which the variables are nonconvex. This last Chapter is devoted to nonconvex optimization problems which involve only linear or quadratic functions, i.e. in a sense functions with lowest degree of nonconvexity.


Quadratic Program Convex Envelope Nonconvex Function Nonconvex Quadratic Program Bilinear Program 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer Science+Business Media Dordrecht 1998

Authors and Affiliations

  • Hoang Tuy
    • 1
  1. 1.Institute of MathematicsHanoiVietnam

Personalised recommendations