Pages that link to "Item:Q5704081"
From MaRDI portal
The following pages link to Semidefinite Programming vs. LP Relaxations for Polynomial Programming (Q5704081):
Displaying 31 items.
- A dynamic inequality generation scheme for polynomial programming (Q263184) (← links)
- RLT-POS: reformulation-linearization technique-based optimization software for solving polynomial programming problems (Q340017) (← links)
- Rank of Handelman hierarchy for Max-Cut (Q408389) (← links)
- Enhancing RLT-based relaxations for polynomial programming problems via a new class of \(v\)-semidefinite cuts (Q453612) (← links)
- Handelman's hierarchy for the maximum stable set problem (Q480821) (← links)
- Semidefinite relaxations of dynamical programs under discrete constraints (Q601981) (← links)
- A hierarchy of relaxations leading to the convex hull representation for general discrete optimization problems (Q817200) (← links)
- A linear programming reformulation of the standard quadratic optimization problem (Q868634) (← links)
- The spherical constraint in Boolean quadratic programs (Q925238) (← links)
- Exploiting equalities in polynomial programming (Q935230) (← links)
- Exact relaxations of non-convex variational problems (Q941046) (← links)
- Positive polynomials and semidefinite programming (Q948606) (← links)
- Sparse-BSOS: a bounded degree SOS hierarchy for large scale polynomial optimization with sparsity (Q1646680) (← links)
- On linear programming relaxations for solving polynomial programming problems (Q1654348) (← links)
- Completely positive and completely positive semidefinite tensor relaxations for polynomial optimization (Q1704915) (← links)
- Copositivity and complete positivity. Abstracts from the workshop held October 29 -- Novermber 4, 2017 (Q1731962) (← links)
- Products of positive forms, linear matrix inequalities, and Hilbert 17th problem for ternary forms (Q1877018) (← links)
- A ``joint + marginal'' heuristic for 0/1 programs (Q1928265) (← links)
- Discrete dynamical system approaches for Boolean polynomial optimization (Q2161551) (← links)
- Alternative SDP and SOCP approximations for polynomial optimization (Q2287850) (← links)
- Handelman rank of zero-diagonal quadratic programs over a hypercube and its applications (Q2392765) (← links)
- A bounded degree SOS hierarchy for polynomial optimization (Q2397758) (← links)
- An alternative approach for nonlinear optimal control problems based on the method of moments (Q2457954) (← links)
- Numerical multilinear algebra and its applications (Q2477577) (← links)
- Global optimization for sum of generalized fractional functions (Q2479363) (← links)
- An Iterative Scheme for Valid Polynomial Inequality Generation in Binary Polynomial Programming (Q3009764) (← links)
- SDP vs. LP Relaxations for the Moment Approach in Some Performance Evaluation Problems (Q3157861) (← links)
- Coarse-Convex-Compactification Approach to Numerical Solution of Nonconvex Variational Problems (Q3590027) (← links)
- Lifting the Convex Conjugate in Lagrangian Relaxations: A Tractable Approach for Continuous Markov Random Fields (Q5043730) (← links)
- Optimal Drug Treatment in a Simple Pandemic Switched System Using Polynomial Approach (Q5268914) (← links)
- LP relaxations for a class of linear semi-infinite programming problems (Q5277959) (← links)
