PRIMAL-DUAL PROXIMAL POINT ALGORITHM FOR MULTICOMMODITY NETWORK FLOW PROBLEMS

In this paper, we consider to apply a primal-dual proximal point algorithm to the multicommodity network flow problem. A remarkable feature of the algorithm consists in how to find an approximate saddle point of the augmented Lagrangian of the problem. In particular, at each iteration, an approximate solution of the subproblem always satisfies the flow conservation equations for all commodities. This property often turns to be very useful in practical applications. We show some results of numerical experiments and examine the effectiveness of the proposed algorithm.