edoc-Server der Humboldt-Universität zu Berlin

SPEPS Preprint

Author(s): Yu. Nesterov, CORE, Catholic University of Louvain, Louvain-la-Neuve
J.-Ph. Vial, HEC, University of Geneva, Geneva
Title: Confidence level solutions for stochastic programming
Date of Acceptance: 07.04.2000
Submission Date: 14.02.2000
Series Title: Stochastic Programming E-Print Series
(SPEPS)
Editors: Julie L. Higle; Werner Römisch; Surrajeet Sen
Complete Preprint: pdf (urn:nbn:de:kobv:11-10057628)
Keywords (eng): Stochastic programming, Stochastic subgradient, Complexity estimate
Metadata export: To export the complete metadata set as Endote or Bibtex format please click to the appropriate link. Endnote   Bibtex  
print on demand: If you click on this icon you can order a print copy of this publication. Bestellung als gedruckte und gebundene Version bei epubli.de, Ausführung der Bestellung erst nach Bestätigung auf den epubli.de-Seiten
Diese Seite taggen: These icons lead to social bookmarking systems where you can create and manage personal bookmarks and discover bookmakrs of other users.
  • connotea
  • del.icio.us
  • Furl
  • RawSugar

Abstract (eng):
We propose an alternative approach 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 objective value is doubly random, since it depends on two outcomes: the event in the stochastic program and the randomized algorithm. We propose a solution concept in which the probability that the randomized algorithm produces a solution with an expected objective value departing from the optimal one by more than $\epsilon$ 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.
Access Statistics: These data concerning access statistics for individual documents have been compiled using the webserver log files aggregated by AWSTATS. They refer to a monthly access count to the full text documents as well as to the entry page.
 
As for format versions of a document which consist of multiple files (such as HTML) the highest monthly access number to one of the files (chapters) is shown respectivly.
 
To see the detailled access numbers please move the mouse pointer over the single bars of the digaram.
Startseite: 2 ZugriffePDF: 10 ZugriffeStartseite: 3 ZugriffePDF: 2 ZugriffeStartseite: 1 ZugriffePDF: 1 ZugriffeStartseite: 2 ZugriffePDF: 3 ZugriffePDF: 1 ZugriffeStartseite: 2 ZugriffePDF: 3 ZugriffeStartseite: 4 ZugriffePDF: 3 ZugriffeStartseite: 2 ZugriffePDF: 1 ZugriffePDF: 4 ZugriffePDF: 2 ZugriffeStartseite: 1 ZugriffePDF: 8 ZugriffeStartseite: 2 ZugriffeStartseite: 3 ZugriffePDF: 4 ZugriffePDF: 1 ZugriffePDF: 9 ZugriffePDF: 3 ZugriffePDF: 16 ZugriffePDF: 10 Zugriffe
May
11		Jun
11		Jul
11		Aug
11		Sep
11		Oct
11		Nov
11		Dec
11		Feb
12		Apr
12		May
12		Jun
12		Jul
12		Aug
12		Sep
12		Oct
12		Nov
12		Dec
12		Jan
13		Apr
13

MonatMay
11		Jun
11		Jul
11		Aug
11		Sep
11		Oct
11		Nov
11		Dec
11		Feb
12		Apr
12		May
12		Jun
12		Jul
12		Aug
12		Sep
12		Oct
12		Nov
12		Dec
12		Jan
13		Apr
13
Startseite23 12 242   123     
PDF10 213133 1428 41931610

Gesamtzahl der Zugriffe seit May 2011:

  • Startseite – 22 (1.1 pro Monat)
  • PDF – 81 (4.05 pro Monat)
    •  
 
Generated at 25.05.2013, 02:28:54

edoc-Server der Humboldt-Universität zu Berlin  •  Impressum  •  edoc@cms.hu-berlin.de  •  Nutzungsbedingungen  •  Haftungsausschluss  •  Statistik