Inference on Graphs via Semidefinite Programming

Proceedings of the National Academy of Sciences of the United States of America- United States

doi 10.1073/pnas.1603405113

Full Text

Abstract

Available in

Date

Authors

Publisher

Proceedings of the National Academy of Sciences

Related search

Positive Semidefinite Matrix Completions on Chordal Graphs and Constraint Nondegeneracy in Semidefinite Programming

Linear Algebra and Its Applications
Numerical AnalysisAlgebraCombinatoricsNumber TheoryGeometryDiscrete MathematicsTopology
2009English

Linear Index Coding via Semidefinite Programming

2012English

Generalized Chebyshev Bounds via Semidefinite Programming

SIAM Review
Computational MathematicsApplied MathematicsTheoretical Computer Science
2007English

On Approximating Complex Quadratic Optimization Problems via Semidefinite Programming Relaxations

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2005French

Semidefinite Programming

2014English

Semidefinite Programming

SIAM Review
Computational MathematicsApplied MathematicsTheoretical Computer Science
1996English

A Semidefinite Programming Approach to Tensegrity Theory and Realizability of Graphs

2006English

Redundancy in Semidefinite Programming.

English

On Duality Theory for Non-Convex Semidefinite Programming

Annals of Operations Research
Management ScienceDecision SciencesOperations Research
2011English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy