ON CONVERGENCE OF DIRECT MULTIPLICATIVE METHODS IN PROBLEMS OF CONDITIONAL ENTROPY MAXIMIZATION

Studies are made of the convergence of new multiplicative methods rela tive to direct variables in problems of the conditional maximization o f entropy. A general procedure for the proof of the convergence is sug gested, which permits one to extend the domain of the convergence with respect to the initial conditions. A comparison is made with the avai lable algorithms of the given class, such as the multiplicative algebr aic reconstruction technique (MART), block-iterative MART(BI-MART), an d simultaneous MART (SMART).