z-logo
open-access-imgOpen Access
Globally solving quadratic programs with convex objective and complementarity constraints via completely positive programming
Author(s) -
Zhibin Deng,
Ye Tian,
Cheng Lü,
Wenxun Xing
Publication year - 2018
Publication title -
journal of industrial and management optimization
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.325
H-Index - 32
eISSN - 1553-166X
pISSN - 1547-5816
DOI - 10.3934/jimo.2017064
Subject(s) - complementarity (molecular biology) , quadratic programming , mathematical optimization , convex optimization , regular polygon , mixed complementarity problem , computer science , quadratic equation , complementarity theory , sequential quadratic programming , mathematics , genetics , geometry , physics , nonlinear system , quantum mechanics , biology

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here