Polyhedral approximation of a convex function is shown to be controlled by the quantization error of the Monge-Ampère measure of its Legendre-Fenchel dual, yielding a k-center pruning algorithm.
The max-plus finite element method for solving deterministic optimal control problems: Basic properties and convergence analysis,
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
background 1
citation-polarity summary
fields
math.OC 1years
2025 1verdicts
CONDITIONAL 1roles
background 1polarities
background 1representative citing papers
citing papers explorer
-
Duality between polyhedral approximation of value functions and optimal quantization of measures
Polyhedral approximation of a convex function is shown to be controlled by the quantization error of the Monge-Ampère measure of its Legendre-Fenchel dual, yielding a k-center pruning algorithm.