DSOS and SDSOS optimization: LP and SOCP-based alternatives to sum of squares optimization

Research output: Contribution to conferencePaper

41 Scopus citations

Abstract

Sum of squares (SOS) optimization has been a powerful and influential addition to the theory of optimization in the past decade. Its reliance on relatively large-scale semidefinite programming, however, has seriously challenged its ability to scale in many practical applications. In this paper, we introduce DSOS and SDSOS optimization1 as more tractable alternatives to sum of squares optimization that rely instead on linear programming and second order cone programming. These are optimization problems over certain subsets of sum of squares polynomials and positive semidefinite matrices and can be of potential interest in general applications of semidefinite programming where scalability is a limitation.

Original languageEnglish (US)
DOIs
StatePublished - Jan 1 2014
Externally publishedYes
Event2014 48th Annual Conference on Information Sciences and Systems, CISS 2014 - Princeton, NJ, United States
Duration: Mar 19 2014Mar 21 2014

Other

Other2014 48th Annual Conference on Information Sciences and Systems, CISS 2014
CountryUnited States
CityPrinceton, NJ
Period3/19/143/21/14

All Science Journal Classification (ASJC) codes

  • Information Systems

Fingerprint Dive into the research topics of 'DSOS and SDSOS optimization: LP and SOCP-based alternatives to sum of squares optimization'. Together they form a unique fingerprint.

Cite this