Multiplicative iterative algorithms for convex programming
type: Item
instance of: scholarly article
title: Multiplicative iterative algorithms for convex programming
zbMATH Open document ID: 0715.65037
DOI: 10.1016/0024-3795(90)90204-P
published in: Linear Algebra and its Applications
publication date: 1990-01-01T00:00:00Z
review text: 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.
Mathematics Subject Classification ID: 65K05
Mathematics Subject Classification ID: 90C25
zbMATH DE Number: 4178651
zbMATH Keywords: convex programming
zbMATH Keywords: multiplicative iterative algorithms
zbMATH Keywords: large-scale problems
Wikidata QID: Q114852093
author: Paul P. B. Eggermont
reviewed by: Thomas F. Coleman
MaRDI profile type: Publication
cites work: Q3992992
cites work: Q3820395
cites work: Q3803964
cites work: Second- and higher-order duality in nonlinear programming
cites work: Monotone Operators and the Proximal Point Algorithm
cites work: A Statistical Model for Positron Emission Tomography
full work available at URL: 0024-3795(90)90204-p
OpenAlex ID: W2082305681
description: scientific article; zbMATH DE number 4178651