Smooth Quasar-Convex Optimization with Constraints

ArXi:2510.01943v2 Announce Type: replace-cross Quasar-convex functions form a broad nonconvex class with applications to linear dynamical systems, generalized linear models, and Riemannian optimization, among others. Current nearly optimal algorithms work only in affine spaces due to the loss of one degree of freedom when working with general convex constraints.