Lagrangian Dual Method With Self-Concordant Barriers for Multi-Stage Stochastic Nonlinear Programming
نویسنده
چکیده
This paper presents an algorithm for solving multi-stage stochastic nonlinear programs. The algorithm is based on the Lagrangian dual method which relaxes the nonanticipa-tivity 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 globally linear convergence and of polynomial-time complexity.
منابع مشابه
A Lagrangian Dual Method with Self-Concordant Barriers for Multi-Stage Stochastic Convex Nonlinear Programming
This paper presents an algorithm for solving multi-stage stochastic convex non-linear 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 o...
متن کاملA superlinearly convergent algorithm for large scale multi-stage stochastic nonlinear programming
This paper presents an algorithm for solving a class of large scale nonlinear programming problem which is originally derived from the multi-stage stochastic convex nonlinear programming. Using the Lagrangian-dual method and the Moreau-Yosida regularization, the primal problem is neatly transformed into a smooth convex problem. By introducing a self-concordant barrier function, an approximate g...
متن کاملDual Decomposition in Stochastic Integer Programming Dual decomposition in stochastic integer programming
We present an algorithm for solving stochastic integer programming problems with recourse, based on a dual decomposition scheme and Lagrangian relaxation. The approach can be applied to multi-stage problems with mixed-integer variables in each time stage. Numerical experience is presented for some two-stage test problems.
متن کاملGeometric Programming with Stochastic Parameter
Geometric programming is efficient tool for solving a variety of nonlinear optimizationproblems. Geometric programming is generalized for solving engineering design. However,Now Geometric programming is powerful tool for optimization problems where decisionvariables have exponential form.The geometric programming method has been applied with known parameters. However,the observed values of the ...
متن کاملOn the implementation of a log-barrier progressive hedging method for multistage stochastic programs
A progressive hedging method incorporated with self-concordant barrier functions has been developed by Zhao [23] for solving multistage stochastic programs. The method relaxes the nonanticipativity constraints by the Lagrangian dual approach and smooths the Lagrangian dual function by self-concordant barrier functions. This paper discusses in detail the implementation of this method and reports...
متن کامل