arXiv (All)
open access
Multiplicative Gradient Method for Log-Homogeneous Optimization: A Unified Mirror-Descent Framework
Consider the problems of computing $\ell_p$-Lewis weights, Kelly portfolios, D-optimal designs, general equilibria in Fisher markets, and optimal error exponents for channel coding in information theory. All of them can be formulated as optimization problems over the probability simplex, but except
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
- Convex optimization#1331943
- Logarithmic-Free Moment and Generalization Bounds for Uniformly Stable Algorithms#820601
- Modified Polyhedral Method to Elicit Shape-Free Utility and Reduction of Conservatism in Robust Optimization#1326099
- Convex Optimization#6060
- Quantum Maximum Entropy Inference and Hamiltonian Learning#670287
Record · ID 1327925
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