Notoriously hard (mixed-)binary QPs: empirical evidence on new completely positive approaches

By now, many copositive reformulations of mixed-binary QPs have been discussed, triggered by Burer’s seminal characterization from 2009. In conic optimization, it is very common to use approximation hierarchies based on positive-semidefinite (psd) matrices where the order increases with the level of...

Full description

Saved in:

Bibliographic Details
Published in:	Computational management science Vol. 16; no. 4; pp. 593 - 619
Main Authors:	Bomze, Immanuel M., Cheng, Jianqiang, Dickinson, Peter J. C., Lisser, Abdel, Liu, Jia
Format:	Journal Article
Language:	English
Published:	Berlin/Heidelberg Springer Berlin Heidelberg 01.10.2019 Springer Nature B.V Springer Verlag
Subjects:	Approximation Business and Management Convergence Empirical analysis Hierarchies Knapsack problem Mathematical analysis Mathematics Matrix methods Operations research Operations Research/Decision Theory Optimization Optimization and Control Original Paper Probability Solvers 90C20 Penalization method Nonconvex optimization 90C30 Quadratic optimization Copositivity Completely positive Reformulations Nonlinear optimization Mul tidimensional knapsack problem 90C26 Quadratic assignment problem
ISSN:	1619-697X, 1619-6988
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!