A Lagrangian Dual Method with Self-Concordant Barriers for Multi-Stage Stochastic Convex Programming

Authors:
Affiliations:
Venue:
Mathematical Programming: Series A and B
Year:
2005

Citing 0
Cited 5

Moreau---Yosida regularization of Lagrangian-dual functions for a class of convex optimization problems

Journal of Global Optimization
On the implementation of a log-barrier progressive hedging method for multistage stochastic programs

Journal of Computational and Applied Mathematics
Recourse-based stochastic nonlinear programming: properties and Benders-SQP algorithms

Computational Optimization and Applications
Combining Lagrangian decomposition and excessive gap smoothing technique for solving large-scale separable convex optimization problems

Computational Optimization and Applications
Path-following gradient-based decomposition algorithms for separable convex optimization

Journal of Global Optimization

Quantified Score

Hi-index	0.01

Visualization

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.