Semidefinite Programming Relaxations Through Quadratic Reformulation for Box-Constrained Polynomial Optimization Problems

doi 10.1109/codit.2019.8820690

Full Text

Abstract

Available in

Date

Authors

Publisher

IEEE

Related search

On Approximating Complex Quadratic Optimization Problems via Semidefinite Programming Relaxations

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2005French

Complex Quadratic Optimization and Semidefinite Programming

SIAM Journal on Optimization
Theoretical Computer ScienceSoftware
2006English

Semidefinite Relaxations of Ordering Problems

Mathematical Programming, Series B
MathematicsSoftware
2013English

Improved Semidefinite Programming Bounds for Quadratic Assignment Problems With Suitable Symmetry

Mathematical Programming, Series B
MathematicsSoftware
2010English

A Linear Programming Reformulation of the Standard Quadratic Optimization Problem

SSRN Electronic Journal
2005English

The Power of Semidefinite Programming Relaxations for MAX-SAT

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2006English

Validating Numerical Semidefinite Programming Solvers for Polynomial Invariants

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2016English

A Hierarchy of Subgraph Projection-Based Semidefinite Relaxations for Some NP-Hard Graph Optimization Problems

INFOR
Signal ProcessingComputer Science ApplicationsInformation Systems
2015English

Sdpt3r: Semidefinite Quadratic Linear Programming in R

R Journal
UncertaintyNumerical AnalysisStatisticsProbability
2019Italian

Amanote Research

Note-taking for researchers

Follow Amanote

© 2026 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy