In this example, we solve a simple 1D toy problem of minimizing a nonconvex objective subject to a nonconvex constraint.

We first solve the problem using SCP and then use Consensus SCP to solve it.