An explicit equivalent positive semidefinite program for nonlinear 0-1 programs
From MaRDI portal
Recommendations
Cited in
(70)- Block-diagonal semidefinite programming hierarchies for 0/1 programming
- Completely positive and completely positive semidefinite tensor relaxations for polynomial optimization
- Approximating (unweighted) tree augmentation via lift-and-project. I: Stemless TAP
- Optimal control of switching topology networks
- A multilevel analysis of the Lasserre hierarchy
- On self-regular IPMs (with comments and rejoinder)
- An improved semidefinite programming relaxation for the satisfiability problem
- Sparsity in sums of squares of polynomials
- A MAX-CUT formulation of 0/1 programs
- Lift-and-project methods for set cover and knapsack
- Products of positive forms, linear matrix inequalities, and Hilbert 17th problem for ternary forms
- A ``joint + marginal heuristic for 0/1 programs
- \(k\)-point semidefinite programming bounds for equiangular lines
- A combinatorial approach to nonlocality and contextuality
- The theta number of simplicial complexes
- Completely positive reformulations for polynomial optimization
- The density of sets avoiding distance 1 in Euclidean space
- Better approximation algorithms for influence maximization in online social networks
- An improved semidefinite programming hierarchies rounding approximation algorithm for maximum graph bisection problems
- Convex sets with semidefinite representation
- Integrality gaps for colorful matchings
- Semidefinite resolution and exactness of semidefinite relaxations for satisfiability
- Bi-criteria and approximation algorithms for restricted matchings
- 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
- A dynamic inequality generation scheme for polynomial programming
- An explicit semidefinite characterization of satisfiability for Tseitin instances on toroidal grid graphs
- An exact algorithm for linear integer programming problems with distributionally robust chance constraints
- Convex hulls of algebraic sets
- Computational approaches to MAX-cut
- Approximating k-median via pseudo-approximation
- Computation with polynomial equations and inequalities arising in combinatorial optimization
- SDP gaps from pairwise independence
- A polynomial approach for optimal control of switched nonlinear systems
- Optimal learning in linear regression with combinatorial feature selection
- An iterative scheme for valid polynomial inequality generation in binary polynomial programming
- On integrality ratios for asymmetric TSP in the Sherali-Adams hierarchy
- SDP vs. LP Relaxations for the Moment Approach in Some Performance Evaluation Problems
- Sums of squares on the hypercube
- Approximation Limits of Linear Programs (Beyond Hierarchies)
- An approximation algorithm for the balanced Max-3-Uncut problem using complex semidefinite programming rounding
- New product introduction against a predator: a bilevel mixed-integer programming approach
- Enhancing RLT-based relaxations for polynomial programming problems via a new class of \(v\)-semidefinite cuts
- scientific article; zbMATH DE number 1757962 (Why is no real title available?)
- Stability and bifurcations in a model of bacteria immunity with quorum sensing
- Handelman's hierarchy for the maximum stable set problem
- Mildly Exponential Time Approximation Algorithms for Vertex Cover, Balanced Separator and Uniform Sparsest Cut
- On semidefinite least squares and minimal unsatisfiability
- Moment methods in energy minimization: new bounds for Riesz minimal energy problems
- Cones of multipowers and combinatorial optimization problems
- The domain of attraction for the endemic equilibrium of an SIRS epidemic model
- Robust optimization of sums of piecewise linear functions with application to inventory problems
- Partial Lasserre relaxation for sparse Max-Cut
- Polyhedral techniques in combinatorial optimization: matchings and tours
- A Hierarchy of Subgraph Projection-Based Semidefinite Relaxations for Some NP-Hard Graph Optimization Problems
- A study of mixed discrete bilevel programs using semidefinite and semi-infinite programming
- Nonnegative partial s-goodness for the equivalence of a 0-1 linear program to weighted linear programming
- Approximate graph colouring and the hollow shadow
- An improved quantum max cut approximation via maximum matching
- Optirefine: densest subgraphs and maximum cuts with k refinements
- Approximate graph coloring and the crystal with a hollow shadow
- Semidefinite programming and linear equations vs. homomorphism problems
- Dynamic modeling and analysis of the email virus propagation
- 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 1 programs via scaling
- A polynomial approach for stability analysis of switched systems
- A semidefinite programming approach to the generalized problem of moments
This page was built for publication: An explicit equivalent positive semidefinite program for nonlinear 0-1 programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2784435)
