arXiv (All)
open access
Mirror descent algorithms with logarithmic barriers
We derive convergence guarantees for mirror descent and proximal mirror descent with a logarithmic barrier as the distance-generating function. When the solution lies on the boundary, the Bregman divergence blows up and classical guarantees become vacuous. While existing remedies recover $O(\log k/k
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Block-Norm Geometries for Online Mirror Descent with Sparse Losses#1069746
- Ellipsoid Separation in Data-Dependent Time via Infimal Displacement Vectors#1456725
- Overcoming the spatial order barrier for nonlinear SPDEs with additive space-time white noise#792973
- Overcoming the spatial order barrier for nonlinear SPDEs with additive space-time white noise#788969
- Polyak-Type Extragradient Methods for Monotone Root-Finding Problems#1062470
Record · ID 1458433
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive