On an SDP relaxation for kissing number

Jon Lee; Leo Liberti

doi:10.1007/s11590-018-1239-9

On an SDP relaxation for kissing number

Jon Lee
, Leo Liberti

University of Michigan, Ann Arbor

Research output: Contribution to journal › Article › peer-review

Abstract

We demonstrate that an earlier semidefinite-programming relaxation for the kissing-number problem cannot provide good upper bounds. Furthermore, we show the existence of an optimal solution for this relaxation that cannot be used as a basis for establishing a good lower bound.

Original language	English
Pages (from-to)	417-422
Number of pages	6
Journal	Optimization Letters
Volume	14
Issue number	2
DOIs	https://doi.org/10.1007/s11590-018-1239-9
Publication status	Published - 1 Mar 2020

Keywords

Kissing number
Relaxation
Semidefinite programming

Access to Document

10.1007/s11590-018-1239-9

Cite this

@article{88a8808eb31a463b957ff69c1a4c51ce,

title = "On an SDP relaxation for kissing number",

abstract = "We demonstrate that an earlier semidefinite-programming relaxation for the kissing-number problem cannot provide good upper bounds. Furthermore, we show the existence of an optimal solution for this relaxation that cannot be used as a basis for establishing a good lower bound.",

keywords = "Kissing number, Relaxation, Semidefinite programming",

author = "Jon Lee and Leo Liberti",

note = "Publisher Copyright: {\textcopyright} 2018, Springer-Verlag GmbH Germany, part of Springer Nature.",

year = "2020",

month = mar,

day = "1",

doi = "10.1007/s11590-018-1239-9",

language = "English",

volume = "14",

pages = "417--422",

journal = "Optimization Letters",

issn = "1862-4472",

number = "2",

}

TY - JOUR

T1 - On an SDP relaxation for kissing number

AU - Lee, Jon

AU - Liberti, Leo

PY - 2020/3/1

Y1 - 2020/3/1

N2 - We demonstrate that an earlier semidefinite-programming relaxation for the kissing-number problem cannot provide good upper bounds. Furthermore, we show the existence of an optimal solution for this relaxation that cannot be used as a basis for establishing a good lower bound.

AB - We demonstrate that an earlier semidefinite-programming relaxation for the kissing-number problem cannot provide good upper bounds. Furthermore, we show the existence of an optimal solution for this relaxation that cannot be used as a basis for establishing a good lower bound.

KW - Kissing number

KW - Relaxation

KW - Semidefinite programming

UR - https://www.scopus.com/pages/publications/85045137155

U2 - 10.1007/s11590-018-1239-9

DO - 10.1007/s11590-018-1239-9

M3 - Article

AN - SCOPUS:85045137155

SN - 1862-4472

VL - 14

SP - 417

EP - 422

JO - Optimization Letters

JF - Optimization Letters

IS - 2

ER -

On an SDP relaxation for kissing number

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this