arXiv (All)
open access
Connecting max-entropy with computational geometry, LP and SDP
We consider the well-known max-(relative) entropy problem $Θ$(y) = infQ$\ll$P DKL(Q P ) with Kullback-Leibler divergence on a domain $Ω$ $\subset$ R d , and with ''moment'' constraints h dQ = y, y $\in$ R m . We show that when m $\le$ d, $Θ$ is the Cram{é}r transform of a function v that solves a si
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
- Sharp homogeneous Gagliardo--Nirenberg inequalities and normalized solutions for generalized stationary MMT equations#1076935
- Trudinger-Moser embeddings on weighted Sobolev spaces on unbounded domains#984012
- Quasi-optimal Sampling from Gibbs States via Non-commutative Optimal Transport Metrics#142396
- Convergence in Hölder norms for Markovian approximations of stochastic Volterra equations#1123832
- Choquet-type extensions of set-pair functions, and applications in graph limits, hypergraphs, and metric measure spaces#1156444
Record · ID 1014588
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