A facial reduction algorithm for finding sparse SOS representations

Hayato Waki; Masakazu Muramatsu

doi:10.1016/j.orl.2010.05.011

A facial reduction algorithm for finding sparse SOS representations

Hayato Waki, Masakazu Muramatsu

Division of Applied Mathematics

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

12 Citations (Scopus)

Abstract

The facial reduction algorithm reduces the size of the positive semidefinite cone in SDP. The elimination method for a sparse SOS polynomial [M. Kojima, S. Kim, H. Waki, Sparsity in sums of squares of polynomials, Math. Program. 103 (2005) 4562] removes monomials which do not appear in any SOS representations. In this paper, we establish a relationship between a facial reduction algorithm and the elimination method for a sparse SOS polynomial.

Original language	English
Pages (from-to)	361-365
Number of pages	5
Journal	Operations Research Letters
Volume	38
Issue number	5
DOIs	https://doi.org/10.1016/j.orl.2010.05.011
Publication status	Published - Sep 2010

All Science Journal Classification (ASJC) codes

Software
Management Science and Operations Research
Industrial and Manufacturing Engineering
Applied Mathematics

Access to Document

10.1016/j.orl.2010.05.011

Fingerprint Dive into the research topics of 'A facial reduction algorithm for finding sparse SOS representations'. Together they form a unique fingerprint.

Cite this

@article{39096f00049040dba0612ac8b9d774f3,

title = "A facial reduction algorithm for finding sparse SOS representations",

abstract = "The facial reduction algorithm reduces the size of the positive semidefinite cone in SDP. The elimination method for a sparse SOS polynomial [M. Kojima, S. Kim, H. Waki, Sparsity in sums of squares of polynomials, Math. Program. 103 (2005) 4562] removes monomials which do not appear in any SOS representations. In this paper, we establish a relationship between a facial reduction algorithm and the elimination method for a sparse SOS polynomial.",

author = "Hayato Waki and Masakazu Muramatsu",

year = "2010",

month = sep,

doi = "10.1016/j.orl.2010.05.011",

language = "English",

volume = "38",

pages = "361--365",

journal = "Operations Research Letters",

issn = "0167-6377",

publisher = "Elsevier",

number = "5",

}

TY - JOUR

T1 - A facial reduction algorithm for finding sparse SOS representations

AU - Waki, Hayato

AU - Muramatsu, Masakazu

PY - 2010/9

Y1 - 2010/9

N2 - The facial reduction algorithm reduces the size of the positive semidefinite cone in SDP. The elimination method for a sparse SOS polynomial [M. Kojima, S. Kim, H. Waki, Sparsity in sums of squares of polynomials, Math. Program. 103 (2005) 4562] removes monomials which do not appear in any SOS representations. In this paper, we establish a relationship between a facial reduction algorithm and the elimination method for a sparse SOS polynomial.

AB - The facial reduction algorithm reduces the size of the positive semidefinite cone in SDP. The elimination method for a sparse SOS polynomial [M. Kojima, S. Kim, H. Waki, Sparsity in sums of squares of polynomials, Math. Program. 103 (2005) 4562] removes monomials which do not appear in any SOS representations. In this paper, we establish a relationship between a facial reduction algorithm and the elimination method for a sparse SOS polynomial.

UR - http://www.scopus.com/inward/record.url?scp=77956338949&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=77956338949&partnerID=8YFLogxK

U2 - 10.1016/j.orl.2010.05.011

DO - 10.1016/j.orl.2010.05.011

M3 - Article

AN - SCOPUS:77956338949

VL - 38

SP - 361

EP - 365

JO - Operations Research Letters

JF - Operations Research Letters

SN - 0167-6377

IS - 5

ER -