2007-07-08Buch DOI: 10.18452/8380
Self-concordant Tree and Decomposition Based Interior Point Methods for Stochastic Convex Optimization Problem
We consider barrier problems associated with two and multistage stochastic convex optimization problems. We show that the barrier recourse functions at any stage form a self-concordant family with respect to the barrier parameter. We also show that the complexityvalue of the ﬁrst stage problem increases additively with the number of stages and scenarios. Weuse these results to propose a prototype primal interior point decomposition algorithm for thetwo-stage and multistage stochastic convex optimization problems admitting self-concordantbarriers.
Dateien zu dieser Publikation
Is Part Of Series: Mathematical Programming (A)