An Explicit Equivalent Positive Semidefinite Program for Nonlinear 0-1 Programs
From MaRDI portal
Publication:2784435
DOI10.1137/S1052623400380079zbMath1007.90046MaRDI QIDQ2784435
Publication date: 23 April 2002
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
90C22: Semidefinite programming
90C30: Nonlinear programming
90C27: Combinatorial optimization
90C09: Boolean programming
Related Items
A linear programming reformulation of the standard quadratic optimization problem, Exploiting equalities in polynomial programming, The equivalence of semidefinite relaxations of polynomial 0-1 and \(\pm 1\) programs via scaling, A semidefinite programming approach to the generalized problem of moments, Block-diagonal semidefinite programming hierarchies for 0/1 programming, On self-regular IPMs (with comments and rejoinder), An improved semidefinite programming relaxation for the satisfiability problem, Sparsity in sums of squares of polynomials, Products of positive forms, linear matrix inequalities, and Hilbert 17th problem for ternary forms, Convex sets with semidefinite representation, Efficiency improvement in an \(n\)D systems approach to polynomial optimization, Uniform stabilization of discrete-time switched and Markovian jump linear systems, Robust global optimization with polynomials, A semidefinite programming based polyhedral cut and price approach for the maxcut problem, An explicit semidefinite characterization of satisfiability for Tseitin instances on toroidal grid graphs, SDP vs. LP Relaxations for the Moment Approach in Some Performance Evaluation Problems
