arXiv (All)
open access
Smooth or Separable? Sparse Block Acceleration for Entropy-Regularized Linear Programs
We study entropy-regularized linear programs with sparse affine constraints and compare two exact dual representations induced by whether a redundant normalization constraint is retained or eliminated. Eliminating it yields a partially separable sum-exp dual with sparse affine factors but unbounded
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
- Strong Duality in Risk-Constrained Nonconvex Functional Programming#1014439
- Extended Formulations in Mixed-Integer Convex Programming#364420
- Sharp Singularity-Degree Bounds for Equality-Generated SDP-RLT Relaxations of Binary Programs#799193
- Sharp Singularity-Degree Bounds for Equality-Generated SDP-RLT Relaxations of Binary Programs#797770
- On the integrality gap of convex mixed-integer programs#149208
Record · ID 1116889
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