Skip to content

New nonconvex algorithm

Compare
Choose a tag to compare
@bmeyers bmeyers released this 14 Apr 22:53
· 39 commits to main since this release
e4f9c58

This release of QSS implements a new algorithm for solving nonconvex quadratic separable problems. Previously, we implemented nonconvex ADMM for cost nonconvex cost functions that have closed-form proximal operators. Now, we begin by solving a relaxed convex version of the problem, and then we use that solution to start the iterates of nonconvex ADMM. In practice, this method is much better at avoiding suboptimal local minima.