|edoc-Server der Humboldt-Universität zu Berlin|
|Author(s):||Marc Steinbach, Konrad-Zuse-Zentrum für Informationstechnik Berlin (ZIB)||Title:||Tree-sparse convex programs|
|Date of Acceptance:||23.09.2001|
Stochastic Programming E-Print Series |
|Editors:||Julie L. Higle; Werner Römisch; Surrajeet Sen|
|Keywords (eng):||Convex program, tree, discrete-time optimal control, dynamic stochastic program, recursive factorization, local projection|
Mathematical methods of operations research 3 (Vol. 56, 2003)
Springer (Berlin [u.a.])
|Metadata export: To export the complete metadata set as Endote or Bibtex format please click to the appropriate link.||Endnote Bibtex|
|Dynamic stochastic programs are prototypical for optimization problems with an inherent tree structure including characteristic sparsity patterns in the KKT systems of interior methods. We propose an integrated modeling and solution approach for such tree-sparse programs. Three closely related natural formulations are theoretically analyzed from a control-theoretic perspective and compared to each other. Associated KKT system solution algorithms with linear complexity are developed and comparisons to other interior approaches and related problem formulations are discussed.|
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 Jan 2016: