Abstract
We give a Bellman proof of Bobkov’s inequality using arguments of dynamic programming. As a byproduct of the method we obtain a characterization of smooth optimizers.
Cite
CITATION STYLE
APA
Barthe, F., & Ivanisvili, P. (2020). Bobkov’s inequality via optimal control theory. In Lecture Notes in Mathematics (Vol. 2256, pp. 49–61). Springer. https://doi.org/10.1007/978-3-030-36020-7_3
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free