• Home
  1. Home
  2. Confidence Level Solutions for Stochastic Programming
Report
OA Policy
English

Confidence Level Solutions for Stochastic Programming

Contributors

Nestorov, Yurii; Vial, Jean-Philippe

Collection

  • Cahiers de recherche; 2000.05

Publication date

2000

Abstract

We propose an alternative apporach to stochastic programming based on Monte-Carlo sampling and stochastic gradient optimization. The procedure is by essence probabilistic and the computed solution is a random variable. The associated objectiev value is doubly random, since it depends two outcomes: the event in the stochastic program and the randomized algorithm. We propose a solution concept in which the propability that the randomized algorithm produces a solution with an expected objective value departing from the optimal one by more than is small enough. We derive complexity bounds for this process. We show that by repeating the basic process on independent sample, one can significantly sharpen the complexity bounds.

UNIGE affiliation entities

Citation (ISO format)

NESTOROV, Yurii, VIAL, Jean-Philippe. Confidence Level Solutions for Stochastic Programming. 2000

Main files (1)

Report

Identifiers

  • PID : unige:5864
665views
1159downloads

Technical informations

Creation

15/04/2010 12:20:49

First validation

15/04/2010 12:20:49

Update

14/03/2023 15:26:53

Status update

14/03/2023 15:26:53

Last indexation

29/10/2024 14:25:02
All rights reserved by Archive ouverte UNIGE and the University of Geneva
OpenAIRE Indexed & Validated