Notoriously hard (mixed-)binary QPs : empirical evidence on new completely positive approaches
Year of publication: |
2019
|
---|---|
Authors: | Bomze, Immanuel M. ; Cheng, Jianqiang ; Dickinson, Peter J. C. ; Lisser, Abdel ; Liu, Jia |
Published in: |
Computational Management Science : CMS. - Berlin : Springer, ISSN 1619-697X, ZDB-ID 2136735-8. - Vol. 16.2019, 4, p. 593-619
|
Subject: | Copositivity | Completely positive | Quadratic optimization | Reformulations | Nonlinear optimization | Nonconvex optimization | Penalization method | Quadratic assignment problem | Multtidimensional knapsack problem | Theorie | Theory | Mathematische Optimierung | Mathematical programming | Nichtlineare Optimierung | Nonlinear programming | Ganzzahlige Optimierung | Integer programming |
-
Interplay of non-convex quadratically constrained problems with adjustable robust optimization
Bomze, Immanuel M., (2021)
-
Aspects of quadratic optimization : nonconvexity, uncertainty, and applications
Marandi, Ahmadreza, (2017)
-
Worst-case iteration bounds for log barrier methods on problems with nonconvex constraints
Hinder, Oliver, (2024)
- More ...
-
A second-order cone programming approach for linear programs with joint probabilistic constraints
Cheng, Jianqiang, (2012)
-
A completely positive representation of 0-1 linear programs with joint probabilistic constraints
Cheng, Jianqiang, (2013)
-
A second-order cone programming approach for linear programs with joint probabilistic constraints
Cheng, Jianqiang, (2012)
- More ...