A Lagrangian Dual Method with Self-Concordant Barriers for Multi-Stage Stochastic Convex Programming |
| |
Authors: | Gongyun Zhao |
| |
Institution: | (1) Department of Mathematics, National University of Singapore, 2 Science Drive 2, Singapore, 117543 |
| |
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.Mathematics Subject Classification (2000): 90C15, 90C51, 90C06, 90C25, 90C60Research is partially supported by NUS Academic Research Grant R-146-000-006-112 |
| |
Keywords: | multi-stage stochastic nonlinear programming lagrangian dual self-concordant barrier interior point methods polynomial-time complexity |
本文献已被 SpringerLink 等数据库收录! |
|