DSOS and SDSOS Optimization: More Tractable Alternatives to Sum of Squares and Semidefinite Optimization | Zendy

Amir Ali Ahmadi | Zendy; Anirudha Majumdar | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

DSOS and SDSOS Optimization: More Tractable Alternatives to Sum of Squares and Semidefinite Optimization

Author(s) -

Amir Ali Ahmadi,

Anirudha Majumdar

Publication year - 2019

Publication title -

siam journal on applied algebra and geometry

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 1.052

H-Index - 15

ISSN - 2470-6566

DOI - 10.1137/18m118935x

Subject(s) - semidefinite programming , explained sum of squares , mathematical optimization , optimization problem , mathematics , linear programming , least squares function approximation , polynomial , second order cone programming , computer science , convex optimization , geometry , regular polygon , mathematical analysis , statistics , estimator

In recent years, optimization theory has been greatly impacted by the advent of sum of squares (SOS) optimization. The reliance of this technique on large-scale semidefinite programs, however, has ...

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research