On Approximating Complex Quadratic Optimization Problems via Semidefinite Programming Relaxations

Lecture Notes in Computer Science- Germany

doi 10.1007/11496915_10

Full Text

Abstract

Available in

Date

Authors

Publisher

Springer Berlin Heidelberg

Related search

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

2019English

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

Inference on Graphs via Semidefinite Programming

Proceedings of the National Academy of Sciences of the United States of America
Multidisciplinary
2016English

The Power of Semidefinite Programming Relaxations for MAX-SAT

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2006English

Sdpt3r: Semidefinite Quadratic Linear Programming in R

R Journal
UncertaintyNumerical AnalysisStatisticsProbability
2019Italian

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

INFOR
Signal ProcessingComputer Science ApplicationsInformation Systems
2015English

Study on Fuzzy Quadratic Programming Problems

DEStech Transactions on Computer Science and Engineering
2019English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy