Extended scenario analysis (Q1176855): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Solving multistage stochastic networks: An application of scenario aggregation / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Stochastic network optimization models for investment planning / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Convex Analysis / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Augmented Lagrangians and Applications of the Proximal Point Algorithm in Convex Programming / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Monotone Operators and the Proximal Point Algorithm / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Partial inverse of a monotone operator / rank | |||
Normal rank |
Revision as of 11:01, 15 May 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Extended scenario analysis |
scientific article |
Statements
Extended scenario analysis (English)
0 references
25 June 1992
0 references
\textit{R. T. Rockafellar} and \textit{R. J.-B. Wets} considered scenario problems in stochastic programming and proposed a solution method which they called the progressive hedging algorithm [see Math. Oper. Res. 16, No. 1, 119-147 (1991; Zbl 0729.90067)]. In the present paper nonseparable convex constraints \(x\in\bigcap^ m_{i=1}K_ i\), where \(K_ i\) are nonempty closed convex subsets of \(R^ n\), are added and the progressive hedging algorithm is extended to this problem. As an illustrative example a portfolio optimization problem is solved.
0 references
scenario analysis
0 references
progressive hedging algorithm
0 references
nonseparable convex constraints
0 references
portfolio optimization
0 references
0 references