Please use this identifier to cite or link to this item:
|Title:||A lagrangian dual method with self-concordant barriers for multi-stage stochastic convex programming|
|Keywords:||Interior point methods|
Multi-stage stochastic nonlinear programming
|Citation:||Zhao, G. (2005-01). A lagrangian dual method with self-concordant barriers for multi-stage stochastic convex programming. Mathematical Programming 102 (1) : 1-24. ScholarBank@NUS Repository. https://doi.org/10.1007/s10107-003-0471-x|
|Abstract:||This paper presents an algorithm for solving multi-stage stochastic convex nonlinear programs. The algorithm is based on the Lagrangian dual method which relaxes the nonanticipativity constraints, and the barrier function method which enhances the smoothness of the dual objective function so that the Newton search directions can be used. The algorithm is shown to be of global convergence and of polynomial-time complexity.|
|Source Title:||Mathematical Programming|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Aug 10, 2018
WEB OF SCIENCETM
checked on Jul 9, 2018
checked on Jul 27, 2018
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.