On Tractability, Complexity, and Mixed-Integer Convex Programming Representability of Distributionally Favorable Optimization

TL;DR

Despite the typical nonconvex nature of DFO problems, the results show that they are mixed-integer convex programming representable (MICP-R), thereby enabling solutions via standard optimization solvers via standard optimization solvers.

Abstract

Distributionally Favorable Optimization (DFO) is an important framework for decision-making under uncertainty, with applications across fields such as reinforcement learning, online learning, robust statistics, chance-constrained programming, and two-stage stochastic optimization without relatively complete recourse. In contrast to the traditional Distributionally Robust Optimization (DRO) paradigm, DFO presents a unique challenge -- the application of the inner infimum operator often fails to retain the convexity. In light of this challenge, we study the tractability and complexity of DFO. We establish sufficient and necessary conditions for determining when DFO problems are tractable or intractable. Despite the typical nonconvex nature of DFO problems, our findings show that they are mixed-integer convex programming representable (MICP-R), thereby enabling solutions via standard optimization solvers. Finally, we numerically validate the efficacy of our MICP-R formulations.

Figures (2)

• Figure 1: Illustration of Quantile Comparisons in Experiment 2
• Figure 2: Illustration of Quantile Comparisons in Experiment 3

Theorems & Definitions (43)

• proposition thmcounterproposition
• proof
• definition thmcounterdefinition
• definition thmcounterdefinition
• lemma thmcounterlemma
• definition thmcounterdefinition
• lemma thmcounterlemma
• proof
• theorem 1
• proof