Semidefinite Programming vs. LP Relaxations for Polynomial Programming
From MaRDI portal
Publication:5704081
DOI10.1287/moor.27.2.347.322zbMath1082.90554OpenAlexW2138322123MaRDI QIDQ5704081
Publication date: 11 November 2005
Published in: Mathematics of Operations Research (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/848031593fccfb740c5ca9c511fb5cd98293c738
Semidefinite programming (90C22) Nonconvex programming, global optimization (90C26) Boolean programming (90C09) Real algebraic and real-analytic geometry (14P99)
Related Items
LP relaxations for a class of linear semi-infinite programming problems, SDP vs. LP Relaxations for the Moment Approach in Some Performance Evaluation Problems, Products of positive forms, linear matrix inequalities, and Hilbert 17th problem for ternary forms, Lifting the Convex Conjugate in Lagrangian Relaxations: A Tractable Approach for Continuous Markov Random Fields, Sparse-BSOS: a bounded degree SOS hierarchy for large scale polynomial optimization with sparsity, RLT-POS: reformulation-linearization technique-based optimization software for solving polynomial programming problems, On linear programming relaxations for solving polynomial programming problems, Handelman rank of zero-diagonal quadratic programs over a hypercube and its applications, Discrete dynamical system approaches for Boolean polynomial optimization, A bounded degree SOS hierarchy for polynomial optimization, A linear programming reformulation of the standard quadratic optimization problem, Semidefinite relaxations of dynamical programs under discrete constraints, A ``joint + marginal heuristic for 0/1 programs, Rank of Handelman hierarchy for Max-Cut, Completely positive and completely positive semidefinite tensor relaxations for polynomial optimization, Enhancing RLT-based relaxations for polynomial programming problems via a new class of \(v\)-semidefinite cuts, The spherical constraint in Boolean quadratic programs, Handelman's hierarchy for the maximum stable set problem, Copositivity and complete positivity. Abstracts from the workshop held October 29 -- Novermber 4, 2017, Exploiting equalities in polynomial programming, An alternative approach for nonlinear optimal control problems based on the method of moments, Exact relaxations of non-convex variational problems, An Iterative Scheme for Valid Polynomial Inequality Generation in Binary Polynomial Programming, Numerical multilinear algebra and its applications, Global optimization for sum of generalized fractional functions, Coarse-Convex-Compactification Approach to Numerical Solution of Nonconvex Variational Problems, Alternative SDP and SOCP approximations for polynomial optimization, Optimal Drug Treatment in a Simple Pandemic Switched System Using Polynomial Approach, A hierarchy of relaxations leading to the convex hull representation for general discrete optimization problems, A dynamic inequality generation scheme for polynomial programming
Uses Software
