作者: A. N. Iusem , S. A. Zenios
DOI: 10.1080/02331939508844144
关键词:
摘要: In this paper we present a version of the underrelaxed Bregman's method for convex programming adapted case interval constraints and establish its convergence. This Underrelaxed Bregman Algorithm (IUB) is used then to convergence simple algorithm in which minimand entropy functional. algorithm, called IMART, substitutes closed-form formulate minimization subproblems IUB. IMART applied generalized multicommodity network flow problem.