Stochastic Programming

Modeling uncertainty processes for multi-stage optimization of strategic energy planning: An auto-regressive and Markov chain formulation

  • Esnil Guevara
  • Frédéric Babonneau
  • Tito Homem-de-Mello
    • Categories Applications - OR and Management Sciences, Stochastic Programming Tags , , ,

    This paper deals with the modeling of stochastic processes in long-term multistage energy planning problems when little information is available on the degree of uncertainty of such processes. Starting from simple estimates of variation intervals for uncertain parameters, such as energy demands and costs, we model the temporal correlation of these parameters through autoregressive (AR) … Read more

    Intraday Power Trading: Towards an Arms Race in Weather Forecasting?

  • Thomas Kuppelwieser
  • David Wozabal
    • Categories Finance and Economics, Stochastic Programming Tags , , , ,

    We propose the first weather-based algorithmic trading strategy on a continuous intraday power market. The strategy uses neither production assets nor power demand and generates profits purely based on superior information about aggregate output of weather-dependent renewable production. We use an optimized parametric policy based on state-of-the-art intraday updates of renewable production forecasts and evaluate … Read more

    Exact Solutions to a Carsharing Pricing and Relocation Problem under Uncertainty

  • Giovanni Pantuso
    • Categories Stochastic Programming, Transportation Tags , ,

    In this article we study the problem of jointly deciding carsharing prices and vehicle relocations. We consider carsharing services operating in the context of multi-modal urban transportation systems. Pricing decisions take into account the availability of alternative transport modes, and customer preferences with respect to these. In order to account for the inherent uncertainty in … Read more

    Non-anticipative risk-averse analysis with effective scenarios applied to long-term hydrothermal scheduling

  • Karla Cristiane Arsie
  • Clóvis Caesar Gonzaga
  • Elizabeth Wegner Karas
  • Gislaine Aparecida Periçaro
    • Categories Nonlinear Optimization, Stochastic Programming Tags , , ,

    In this paper, we deal with long-term operation planning problems of hydrothermal power systems by considering scenario analysis and risk aversion. This is a stochastic sequential decision problem whose solution must be non-anticipative, in the sense that a decision at a stage cannot use a perfect knowledge of the future. We propose strategies to reduce … Read more

    Stochastic Gauss-Newton Algorithms for Online PCA

  • Siyun Zhou
  • Xin Liu
  • Liwei Xu
    • Categories Stochastic Programming Tags , , ,

    In this paper, we propose a stochastic Gauss-Newton (SGN) algorithm to study the online principal component analysis (OPCA) problem, which is formulated by using the symmetric low-rank product (SLRP) model for dominant eigenspace calculation. Compared with existing OPCA solvers, SGN is of improved robustness with respect to the varying input data and algorithm parameters. In … Read more

    Parametric complexity analysis for a class of first-order Adagrad-like algorithms

  • Serge Gratton
  • Sadok Jerad
  • Philippe L. Toint
    • Categories Stochastic Programming, Unconstrained Optimization Tags , , , , ,

    A class of algorithms for optimization in the presence of noise is presented, that does not require the evaluation of the objective function. This class generalizes the well-known Adagrad method. The complexity of this class is then analyzed as a function of its parameters, and it is shown that some methods of the class enjoy … Read more

    Discrete Optimal Transport with Independent Marginals is #P-Hard

  • Bahar Tașkesen
  • Soroosh Shafieezadeh-Abadeh
  • Daniel Kuhn
  • Karthik Natarajan
    • Categories Dynamic Programming, Linear Programming, Stochastic Programming

    We study the computational complexity of the optimal transport problem that evaluates the Wasserstein distance between the distributions of two K-dimensional discrete random vectors. The best known algorithms for this problem run in polynomial time in the maximum of the number of atoms of the two distributions. However, if the components of either random vector … Read more

    Stochastic trust-region and direct-search methods: A weak tail bound condition and reduced sample sizing

  • Francesco Rinaldi
  • Luis Nunes Vicente
  • Damiano Zeffiro
    • Categories Nonsmooth Optimization, Stochastic Programming, Unconstrained Optimization Tags , , ,

    Using tail bounds, we introduce a new probabilistic condition for function estimation in stochastic derivative-free optimization which leads to a reduction in the number of samples and eases algorithmic analyses. Moreover, we develop simple stochastic direct-search and trust-region methods for the optimization of a potentially non-smooth function whose values can only be estimated via stochastic … Read more

    Optimization-based Scenario Reduction for Data-Driven Two-stage Stochastic Optimization

  • Dimitris Bertsimas
  • Nishanth Mundru
    • Categories Applications - OR and Management Sciences, Stochastic Programming Tags , , ,

    We propose a novel, optimization-based method that takes into account the objective and problem structure for reducing the number of scenarios, m, needed for solving two-stage stochastic optimization problems. We develop a corresponding convex optimization-based algorithm, and show that as the number of scenarios increase, the proposed method recovers the SAA solution. We report computational … Read more

    Bounds for Multistage Mixed-Integer Distributionally Robust Optimization

  • Güzin Bayraksan
  • Francesca Maggioni
  • Daniel Faccini
  • Ming Yang
    • Categories Robust Optimization, Stochastic Programming Tags , , , ,

    Multistage mixed-integer distributionally robust optimization (DRO) forms a class of extremely challenging problems since their size grows exponentially with the number of stages. One way to model the uncertainty in multistage DRO is by creating sets of conditional distributions (the so-called conditional ambiguity sets) on a finite scenario tree and requiring that such distributions remain … Read more