Minimization interchange theorem on posets

DOI10.1016/J.JMAA.2021.125927MaRDI QIDQ2069768zbMATH OpenOpenAlexWikidataFDO

Authors Jean-Philippe Chancelier, Michel De Lara, Benoît Tran

Publication date 21 January 2022

Published in Journal of Mathematical Analysis and Applications (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/2107.05903

zbMATH Keywords

minimization interchange theoremsoptimizationposets

Mathematics Subject Classification ID

Stochastic programming (90C15)

Abstract: Interchange theorems between minimization and integration are useful in optimization, especially in optimal control and in stochastic optimization. In this article, we establish a generalized minimization interchange theorem, where integration is replaced by a monotone mapping between posets (partially ordered sets). As an application, we recover, and slightly extend, classical results from the literature, and we tackle the case of the Choquet integral. Our result provides insight on the mechanisms behind existing interchange results.

Review text

The authors establish a generalized minimization interchange theorem between minimization and integration, where integration is replaced by a monotone mapping between posets (patially ordered sets). As an application, they recover, and slightly extend, classical results from the literature, and they tackle the question of interchange between minimization and different integrations (extended Lebesgue, outer and Choquet integrals). Further, the authors provide the background on extended Lebesgue and outer integrals in Appendix A.

Recommendations

• scientific article; zbMATH DE number 4188572
• scientific article; zbMATH DE number 18667
• Subsets of posets minimising the number of chains
• Minimal null designs and a density theorem of posets
• scientific article; zbMATH DE number 5856114
• On minimal prime graphs and posets
• A poset on minimal compositions of a positive integer
• scientific article; zbMATH DE number 5026284
• scientific article; zbMATH DE number 3901093
• scientific article; zbMATH DE number 2169362

Cites work

• Continuous Lattices and Domains
• From a monotone probabilistic scheme to a probabilistic max-plus algorithm for solving Hamilton-Jacobi-Bellman equations
• scientific article; zbMATH DE number 1755831 (Why is no real title available?)
• scientific article; zbMATH DE number 3323562 (Why is no real title available?)
• scientific article; zbMATH DE number 3060775 (Why is no real title available?)
• Idempotent expansions for continuous-time stochastic control
• Infinite dimensional analysis. A hitchhiker's guide.
• Interchangeability principle and dynamic equations in risk averse stochastic programming
• Lectures on Stochastic Programming
• Martingale characterizations of risk-averse stochastic optimization problems
• Necessary and sufficient conditions for the interchange between infimum and the symbol of integration

Cited in

(4)

• Necessary and sufficient conditions for the interchange between infimum and the symbol of integration
• Interchange of infimum and integral
• Conjugate interchangeability and its applications in the theory of monotone class theorem of set form
• scientific article; zbMATH DE number 6120549 (Why is no real title available?)

This page was built for publication: Minimization interchange theorem on posets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2069768)