PulseAugur
EN
LIVE 15:37:21

New optimization framework uses Gaussian mixtures for robust chance-constrained problems

Researchers have developed a new method for distributionally robust linear chance-constrained problems, utilizing a Gaussian mixture model (GMM) to represent uncertainty. This approach improves upon finite-support distributionally robust (FDR) formulations by allowing the worst-case distribution to dynamically determine the number and location of mixture components, as well as their means and covariances within a continuous support. An adaptive cutting-surface algorithm has been created to solve these problems, which endogenously determines the parameters of the mixture components receiving mass. A case study on electric-vehicle charging-station energy allocation demonstrates the framework's effectiveness in meeting reliability targets. AI

RANK_REASON The cluster contains a research paper detailing a new optimization method. [lever_c_demoted from research: ic=1 ai=0.1]

Read on arXiv cs.LG →

AI-generated summary · Google Gemini · from 1 sources. How we write summaries →

New optimization framework uses Gaussian mixtures for robust chance-constrained problems

COVERAGE [1]

  1. arXiv cs.LG TIER_1 English(EN) · Shibshankar Dey, Sanjay Mehrotra ·

    Robust Chance-Constrained Optimization using a Continuous Parameter Space Wasserstein-2 Ambiguity Set of Gaussian Mixtures

    arXiv:2607.17018v1 Announce Type: cross Abstract: We study distributionally robust linear chance-constrained problems in which uncertainty is modeled by a Gaussian mixture model (GMM). Finite-support distributionally robust (FDR) formulations, widely used in data-driven robust op…