arXiv (All)
open access
Duality between polyhedral approximation of value functions and optimal quantization of measures
Approximating a convex function by a polyhedral function that has a limited number of facets is a fundamental problem with applications in various fields, from mitigating the curse of dimensionality in optimal control to bi-level optimization. We establish a connection between this problem and the o
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
- Minimal-Volume Equiangular Hyperbolic $4$-Polytopes#927558
- Data-to-Energy Stochastic Dynamics#799889
- Time-optimal Convexified Reeds-Shepp Paths on a Sphere#149245
- The affine Tverberg theorem revisited#1069981
- Pseudomonotone variational inequality problems : Existence of solutions#430003
Record · ID 1011003
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