Abstract
We consider the general nonlinear optimization problem in 01 variables and provide an explicit equivalent convex positive semidefinite program in 2n-1 variables. The optimal values of both problems are identical. From every optimal solution of the former one easily find an optimal solution of the latter and conversely, from every solution of the latter one may construct an optimal solution of the former.
Cite
CITATION STYLE
Lasserre, J. B. (2001). An explicit exact SDP relaxation for nonlinear 0-1 programs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2081, pp. 293–303). Springer Verlag. https://doi.org/10.1007/3-540-45535-3_23
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
