SearcharxivSearch

arXiv subjects

Diego Fonseca

Publications and source records attributed to Diego Fonseca.

3 recordsLinked to original sources

Scenario-based Regularization: A Tractable Framework for Distributionally Robust Stochastic Optimization

We propose a flexible scenario-based regularized Sample Average Approximation (SBR-SAA) framework for stochastic optimization. This work is motivated by challenges in standard Wasserstein Distributionally Robust Optimization (WDRO), where out-of-sample performance, particularly tail risk, is sensitive to the choice of the p-norm, and formulations can be computationally intractable. Our method is inspired by the asymptotic expansion of the WDRO objective and introduces a regularizer that penalizes the (sub)gradient norm of the objective at a selected set of scenarios. This framework serves a dual purpose: (i) it provides a computationally tractable alternative to WDRO by using a representative subset of the data, and (ii) it can provide targeted robustness by incorporating user-defined adverse scenarios. We establish the theoretical properties of this framework by proving its equivalence to a decision-dependent WDRO problem, from which we derive finite sample guarantees and asymptotic consistency. We demonstrate the method's efficacy in two applications: (1) a multi-product newsvendor problem, where SBR-SAA serves as a tractable alternative to NP-hard WDRO, and (2) a mean-risk portfolio optimization problem, where it successfully uses historical crisis data to improve out-of-sample performance.

math.OC

Wasserstein Distributionally Robust Optimization with Expected Value Constraints

We investigate a stochastic program with expected value constraints, addressing the problem in a general context through Distributionally Robust Optimization (DRO) approach using Wasserstein distances, where the ambiguity set depends on the decision variable. We demonstrate that this approach can be reformulated into a finite-dimensional optimization problem, which, in certain instances, can be convex. Moreover, we establish criteria for determining the feasibility of the problem concerning the Wasserstein radius and the parameter governing the constraint. Finally, we present numerical results within the context of portfolio optimization. In particular, we highlight the distinctions between our approach and several existing non-robust methods, using both simulated data and real financial market data.

math.OC

Decision-dependent Distributionally Robust Optimization

This work presents a new Distributionally Robust Optimization approach, using $p$-Wasserstein metrics, to analyze a stochastic program in a general context. The ambiguity set in this approach depends on the decision variable and is represented as a ball where both the center and the radius depend on the decision variable. We show that, under Lipschitz's assumptions for the objective function, our approach can be reformulated as a finite-dimensional optimization problem, which is sometimes convex. In addition, we numerically compare our proposed approach with the standard formulation of distributionally robust optimization, which typically does not use ambiguity sets dependent on the decision variable, in the context of portfolio optimization.

math.OC