- | ||||
|
![]()
|
Simplified semidefinite and completely positive relaxations
Felix Lieder (lieder Abstract: This paper is concerned with completely positive and semidefinite relaxations of quadratic programs with linear constraints and binary variables as presented by Burer. It observes that all constraints of the relaxation associated with linear constraints of the original problem can be accumulated in a single linear constraint without changing the feasible set of either the completely positive or the semidefinite approximation. It also shows that a tightening of the semidefinite relaxation proposed by Burer is equivalent to the original relaxation. Keywords: Semidefinite relaxation, completely positive relaxation Category 1: Linear, Cone and Semidefinite Programming Category 2: Integer Programming (0-1 Programming ) Category 3: Linear, Cone and Semidefinite Programming (Semi-definite Programming ) Download: Entry Submitted: 07/18/2015 Modify/Update this entry | ||
Visitors | Authors | More about us | Links | |
Subscribe, Unsubscribe Digest Archive Search, Browse the Repository
|
Submit Update Policies |
Coordinator's Board Classification Scheme Credits Give us feedback |
Optimization Journals, Sites, Societies | |
![]() |