A Primal-Dual Algorithm for Monotropic Programming and its Application to Network Optimization
Cahiers de recherche; 1998.13
|Abstract||This paper presents a new primal-dual algorithm for solving a class of monotropic programming problems. This class involves many problems arising in a number of important applications in telecommunications networks, transportation and water distribution. The proposed algorithm is inspired by Kallio and Ruszczynski approach for linear programming. The problem is replaced by a game using two different augmented Lagrangian functions defined for the primal and the dual problems. It is then possible to develop a block-wise Gauss-Seidel method to reach an equilibrium of the game with alternating steps made in each component of the primal and dual variables. We also show that, use of kernels different from the quadratic one in the augmented Lagrangian functions, is possible. Finally, we show how this algorithm may be applied to some important problems in Network Optimization such as the minimum quadratic cost single flow problems and convex multicommoditity flow problems|
This document has no fulltext available yet, but you can contact its author by using the form below.
|OUOROU, Adamou. A Primal-Dual Algorithm for Monotropic Programming and its Application to Network Optimization. 1998 https://archive-ouverte.unige.ch/unige:5895|