But for cubic optimization problems with no constraints, sum of squares becomes a handy test for finding locally optimal minimum solutions. Picture the graph of a polynomial function as a curve ...

Interior Point Methods: A class of optimisation algorithms that navigate the interior of the feasible region to seek optimal solutions, commonly used in linear and convex quadratic programming.