pith. sign in

arxiv: 1310.4716 · v2 · pith:I3AXG7JYnew · submitted 2013-10-17 · 🧮 math.OC · cs.MS· cs.SY· eess.SY

SOSTOOLS Version 4.00 Sum of Squares Optimization Toolbox for MATLAB

classification 🧮 math.OC cs.MScs.SYeess.SY
keywords sostoolspolynomialprogrammingvariablesdecisionparsingsolverstructure
0
0 comments X
read the original abstract

The release of SOSTOOLS v4.00 comes as we approach the 20th anniversary of the original release of SOSTOOLS v1.00 back in April, 2002. SOSTOOLS was originally envisioned as a flexible tool for parsing and solving polynomial optimization problems, using the SOS tightening of polynomial positivity constraints, and capable of adapting to the ever-evolving fauna of applications of SOS. There are now a variety of SOS programming parsers beyond SOSTOOLS, including YALMIP, Gloptipoly, SumOfSquares, and others. We hope SOSTOOLS remains the most intuitive, robust and adaptable toolbox for SOS programming. Recent progress in Semidefinite programming has opened up new possibilities for solving large Sum of Squares programming problems, and we hope the next decade will be one where SOS methods will find wide application in different areas. In SOSTOOLS v4.00, we implement a parsing approach that reduces the computational and memory requirements of the parser below that of the SDP solver itself. We have re-developed the internal structure of our polynomial decision variables. Specifically, polynomial and SOS variable declarations made using sossosvar, sospolyvar, sosmatrixvar, etc now return a new polynomial structure, dpvar. This new polynomial structure, is documented in the enclosed dpvar guide, and isolates the scalar SDP decision variables in the SOS program from the independent variables used to construct the SOS program. As a result, the complexity of the parser scales almost linearly in the number of decision variables. As a result of these changes, almost all users will notice a significant increase in speed, with large-scaleproblems experiencing the most dramatic speedups. Parsing time is now always less than 10% of time spent in the SDP solver. Finally, SOSTOOLS now provides support for the MOSEK solver interface as well as the SeDuMi, SDPT3, CSDP, SDPNAL, SDPNAL+, and SDPA solvers.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 4 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. TinySDP: Real Time Semidefinite Optimization for Certifiable and Agile Edge Robotics

    cs.RO 2026-05 unverdicted novelty 8.0

    TinySDP is the first semidefinite programming solver designed for embedded systems, enabling real-time certifiable model predictive control with nonconvex geometric constraints on microcontrollers.

  2. Compositional Design of Safety Controllers for Large-Scale Stochastic Hybrid Systems

    eess.SY 2024-09 unverdicted novelty 7.0

    Compositional small-gain framework constructs augmented control barrier certificates from subsystem certificates to synthesize safety controllers and bound safety probability for networks of up to 1000 stochastic hybr...

  3. Reach-Avoid Model Predictive Control with Guaranteed Recursive Feasibility via Input Constrained Backstepping

    math.OC 2026-04 unverdicted novelty 6.0

    A backstepping-derived reach-avoid invariant set serves as the terminal constraint in sampled-data MPC, proving recursive feasibility and safe steering to the target for continuous nonlinear systems under input constr...

  4. Polylab: A MATLAB Toolbox for Multivariate Polynomial Modeling

    cs.MS 2026-04 accept novelty 5.0

    Polylab provides a MATLAB toolbox for multivariate polynomials with CPU/GPU support, explicit variable handling, and affine-normal direction computation via automatic differentiation and log-determinant methods.