Multiplicative iterative algorithms for convex programming (Q751770): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0024-3795(90)90204-p / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2082305681 / rank | |||
Normal rank | |||
Latest revision as of 09:24, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Multiplicative iterative algorithms for convex programming |
scientific article |
Statements
Multiplicative iterative algorithms for convex programming (English)
0 references
1990
0 references
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.
0 references
convex programming
0 references
multiplicative iterative algorithms
0 references
large-scale problems
0 references
