Michael J. Neely

Projection-Free Non-Smooth Convex Programming

2022 · arXiv (Cornell University)

In this paper, we provide a sub-gradient based algorithm to solve general constrained convex optimization without taking projections onto the domain set. The well studied Frank-Wolfe type algorithms also avoid projections. However, they are only …