Overview Statistic: PDF-Downloads (blue) and Frontdoor-Views (gray)
The search result changed since you submitted your search request. Documents might be displayed in a different sort order.
  • search hit 14 of 155
Back to Result List

Corrections to “Lower Bounds on the Oracle Complexity of Nonsmooth Convex Optimization via Information Theory”

  • This note closes a gap in the proof of Theorem VI.3 from the article “Lower Bounds on the Oracle Complexity of Nonsmooth Convex Optimization via Information Theory” (2017).

Export metadata

Additional Services

Share in Twitter Search Google Scholar Statistics - number of accesses to the document
Metadaten
Author:Gábor Braun, Cristóbal Guzmán, Sebastian Pokutta
Document Type:Article
Parent Title (English):IEEE Transactions on Information Theory
Volume:70
Issue:7
First Page:5408
Last Page:5409
Year of first publication:2024
DOI:https://doi.org/10.1109/TIT.2024.3357200
Accept ✔
Diese Webseite verwendet technisch erforderliche Session-Cookies. Durch die weitere Nutzung der Webseite stimmen Sie diesem zu. Unsere Datenschutzerklärung finden Sie hier.