|edoc-Server der Humboldt-Universität zu Berlin|
Sanjay Mehrotra, Northwestern University, Evanston|
M. Gökhan Özevin, Northwestern University, Evanston
|Title:||Two-stage stochastic semidefinite programming and decomposition based interior point methods – Theory|
|Date of Acceptance:||11.03.2005|
Stochastic Programming E-Print Series |
|Editors:||Julie L. Higle; Werner Römisch; Surrajeet Sen|
|Complete Preprint:||pdf (urn:nbn:de:kobv:11-10057201)|
|Keywords (eng):||Stochastic programming, semidefinite programming, Benders decomposition, interior point methods, primal-dual methods|
|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.|
|We introduce two stage stochastic semidefinite programs with recourse and present a Benders decomposition based linearly convergent interior point algorithm to solve them. This extends the results in Zhao  wherein it was shown that the logarithmic barrier associated with the recourse function of two-stage stochastic linear programs with recourse behaves as a strongly self-concordant barrier on the first stage solutions. In this paper we develop the necessary theory. A companion paper  addresses implementation issues for the theoretical algorithm of this paper.|
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.
Gesamtzahl der Zugriffe seit Jul 2011: