Multiplicative iterative algorithms for convex programming (Q751770): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q114852093, #quickstatements; #temporary_batch_1704758154380 |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 10:26, 30 January 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
