JavaScript is disabled in your browser. You can still read and search, but features like search previews, menus, and forms may not work until it's enabled.
Skip to content
Abstract
We study efficient algorithms for realizing the first-order oracle complexity of optimization of $G$-Lipschitz convex functions with respect to the $\ell_{q}$-norm over an $\ell_{p}$-ball of radius $R$, where $1\leq p,q\leq \infty$. For $p
Create a free account to bookmark articles, vote on relevance, generate your own syntheses, and join the discussion.
For research and education, not medical advice. Talk with a clinician about your own care.
© 2026 The Consciousness Library
Support Our Mission
Choose your preferred way to support The Consciousness Library's work in advancing consciousness research.
A registered 501(c)(3) nonprofit; donations are tax-deductible in the US.
Donations are processed by Mindscape Collective, our legal entity, and may appear that way on your statement.