SOSOPT: A Toolbox for Polynomial Optimization

Abstract

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

References in corpus (1)

• Symmetry groups, semidefinite programs, and sums of squares

Cited by in corpus (11)

• Dimension reduction for semidefinite programs via Jordan algebras
• Optimization Based Planner Tracker Design for Safety Guarantees
• A convex data-driven approach for nonlinear control synthesis
• Automata Theory Meets Barrier Certificates: Temporal Logic Verification of Nonlinear Systems
• Backward Reachability for Polynomial Systems on A Finite Horizon
• Smaller SDP for SOS Decomposition
• Stability and Performance Verification of Optimization-based Controllers
• Block SOS Decomposition
• Backward Reachability using Integral Quadratic Constraints for Uncertain Nonlinear Systems
• Finite Horizon Backward Reachability Analysis and Control Synthesis for Uncertain Nonlinear Systems
• Controller design and value function approximation for nonlinear dynamical systems