arxiv
PublishedJuly 16, 2026 at 4:00 AM
—neutral
Smooth Quasar-Convex Optimization with Constraints
Publisher summary· verbatim
arXiv:2510.01943v3 Announce Type: replace-cross Abstract: 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
Stay posted· Newsletter
A 5-min weekly brief — top movers, price watch, story of the week.
Discussion
No replies yet. Be first.
Related coverage
More from ARXIV
arxivADS-C: Antidistillation Sampling for Classification16harxivBeyond a Joke: Multi-Angle Reasoning for Detecting and Explaining Harmful Humor in Memes16harxivFrom Black Box to Executable Logic: Explainable Reinforcement Learning through Prolog Expert Systems16harxivA Formally Grounded ODRL Evaluator: Implementation and Comparison16hThe Bubble Brief
WEEKLYRead AI insights every Tuesday — top movers, new releases, story of the week.
Originally published on arxiv ↗