# Sum of squares programming

**URL:** <https://discourse.julialang.org/t/sum-of-squares-programming/121500>\
**Category:** General Usage\
**Created:** [October 20, 2024, 11:52am UTC](https://discourse.julialang.org/t/sum-of-squares-programming/121500 "2024-10-20T11:52:10Z")\
**Posts on this page:** 1\
**Page:** 1

<div class="post-metadata">

**Author:** ![Banan\_alkafri](https://avatars.discourse-cdn.com/v4/letter/b/85f322/32.png) [@Banan\_alkafri](https://discourse.julialang.org/u/Banan_alkafri)\
**Post date:** [October 20, 2024, 11:52am UTC](https://discourse.julialang.org/t/sum-of-squares-programming/121500/1 "2024-10-20T11:52:10Z")

</div>

I’m using Mosek and sum of squares tools but with matrices to solve an optimization problem with constraints. I’ve noticed that when I try to optimize for higher polynomial degrees like 25 or more, Mosek is taking a lot of time to solve the problem and the number of scalarized Semi-definite variables is very large and not right . What might be happening wrong when Mosek is solving the problem?

 ![Screenshot 2024-10-20 at 1.49.50 PM](https://global.discourse-cdn.com/julialang/original/3X/e/4/e46044ffaec9a7200830e3a5e47cd3376bace3bb.png)