Semidefinite Programming vs. LP Relaxations for Polynomial Programming
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 1985306
- Polynomial Programming: LP-Relaxations Also Converge
- A new hierarchy of SDP-relaxations for polynomial programming
- Semidefinite programming relaxations for semialgebraic problems
- A Comparison of the Sherali-Adams, Lovász-Schrijver, and Lasserre Relaxations for 0–1 Programming
Cited in
(40)- Exact relaxations of non-convex variational problems
- New SDP relaxations for unconstrained 0-1 polynomial programming problems
- A dynamic inequality generation scheme for polynomial programming
- Handelman rank of zero-diagonal quadratic programs over a hypercube and its applications
- Rank of Handelman hierarchy for Max-Cut
- Handelman's hierarchy for the maximum stable set problem
- Positive polynomials and semidefinite programming
- An iterative scheme for valid polynomial inequality generation in binary polynomial programming
- Semidefinite programming relaxations for linear semi-infinite polynomial programming
- Exploiting equalities in polynomial programming
- How to generate weakly infeasible semidefinite programs via Lasserre's relaxations for polynomial optimization
- Polynomial Programming: LP-Relaxations Also Converge
- Copositivity and complete positivity. Abstracts from the workshop held October 29 -- Novermber 4, 2017
- Alternative SDP and SOCP approximations for polynomial optimization
- Semidefinite programming relaxations for semialgebraic problems
- A linear programming reformulation of the standard quadratic optimization problem
- The moment-SOS hierarchy: applications and related topics
- Optimal drug treatment in a simple pandemic switched system using polynomial approach
- Semidefinite relaxations of dynamical programs under discrete constraints
- Coarse-convex-compactification approach to numerical solution of nonconvex variational problems
- Products of positive forms, linear matrix inequalities, and Hilbert 17th problem for ternary forms
- A ``joint + marginal heuristic for 0/1 programs
- Discrete dynamical system approaches for Boolean polynomial optimization
- Numerical multilinear algebra and its applications
- RLT-POS: reformulation-linearization technique-based optimization software for solving polynomial programming problems
- A hierarchy of relaxations leading to the convex hull representation for general discrete optimization problems
- A new hierarchy of SDP-relaxations for polynomial programming
- Enhancing RLT-based relaxations for polynomial programming problems via a new class of \(v\)-semidefinite cuts
- scientific article; zbMATH DE number 1985306 (Why is no real title available?)
- A bounded degree SOS hierarchy for polynomial optimization
- LP relaxations for a class of linear semi-infinite programming problems
- On linear programming relaxations for solving polynomial programming problems
- Lifting the convex conjugate in Lagrangian relaxations: a tractable approach for continuous Markov random fields
- An alternative approach for nonlinear optimal control problems based on the method of moments
- The spherical constraint in Boolean quadratic programs
- Sparse-BSOS: a bounded degree SOS hierarchy for large scale polynomial optimization with sparsity
- Global optimization for sum of generalized fractional functions
- A Lagrangian relaxation view of linear and semidefinite hierarchies
- Completely positive and completely positive semidefinite tensor relaxations for polynomial optimization
- SDP vs. LP Relaxations for the Moment Approach in Some Performance Evaluation Problems
This page was built for publication: Semidefinite Programming vs. LP Relaxations for Polynomial Programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5704081)
