Multiplicative iterative algorithms for convex programming
The author considers the use of multiplicative iterative algorithms for the minimization of a differentiable convex function defined on the positive orthant. Such methods may be useful for very large-scale problems. Theoretical issues are considered but computational results are not provided.
scientific article; zbMATH DE number 4178651