Amanote Research

Amanote Research

  • Register
  • Sign In

Generalized Chebyshev Bounds via Semidefinite Programming

SIAM Review- United States

doi 10.1137/s0036144504440543

Full Text

Abstract

Available in

Categories

Computational MathematicsApplied MathematicsTheoretical Computer Science

Date

January 1, 2007

Authors

Lieven VandenbergheStephen BoydKatherine Comanor

Publisher

Society for Industrial & Applied Mathematics (SIAM)


Related search

Semidefinite Programming and Multivariate Chebyshev Bounds

IFAC Proceedings Volumes
2006English

Attainable Bounds for Generalized Moments via Mathematical Programming

English

Inference on Graphs via Semidefinite Programming

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

Linear Index Coding via Semidefinite Programming

2012English

New Upper Bounds for Kissing Numbers From Semidefinite Programming

Journal of the American Mathematical Society
MathematicsApplied Mathematics
2008English

Improved Semidefinite Programming Bounds for Quadratic Assignment Problems With Suitable Symmetry

Mathematical Programming, Series B
MathematicsSoftware
2010English

Semidefinite Programming

2014English

Semidefinite Programming

SIAM Review
Computational MathematicsApplied MathematicsTheoretical Computer Science
1996English

On Approximating Complex Quadratic Optimization Problems via Semidefinite Programming Relaxations

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2005French

Amanote Research

Note-taking for researchers

Follow Amanote


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

Privacy PolicyRefund Policy