# SOSOPT: A Toolbox for Polynomial Optimization

arXiv: https://arxiv.org/abs/1308.1889 · HTML: https://mlsanity.com/paper/1308.1889/

## Key facts

- Cited by 3 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 8 Aug 2013.

## Built on by (most cited first, 3 of 3)

- [Barrier Certified Safety Learning Control: When Sum-of-Square Programming Meets Reinforcement Learning](https://mlsanity.com/paper/2206.07915/) (2022)
- [A practical, fast method for solving sum-of-squares problems for very large polynomials](https://mlsanity.com/paper/2410.19844/) (2024)
- [Sum-of-Squares Programming for Ma-Trudinger-Wang Regularity of Optimal Transport Maps](https://mlsanity.com/paper/2412.13372/) (2024)

## Abstract (arXiv)

SOSOPT is a Matlab toolbox for formulating and solving Sum-of-Squares (SOS) polynomial optimizations. This document briefly describes the use and functionality of this toolbox. Section 1 introduces the problem formulations for SOS tests, SOS feasibility problems, SOS optimizations, and generalized SOS problems. Section 2 reviews the SOSOPT toolbox for solving these optimizations. This section includes information on toolbox installation, formulating constraints, solving SOS optimizations, and setting optimization options. Finally, Section 3 briefly reviews the connections between SOS optimizations and semidefinite programs (SDPs). It is the connection to SDPs that enables SOS optimizations to be solved in an efficient manner
