Conditional gradient method for double-convex fractional programming matrix problems (Q1706413)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Conditional gradient method for double-convex fractional programming matrix problems |
scientific article; zbMATH DE number 6852052
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Conditional gradient method for double-convex fractional programming matrix problems |
scientific article; zbMATH DE number 6852052 |
Statements
Conditional gradient method for double-convex fractional programming matrix problems (English)
0 references
22 March 2018
0 references
The authors consider the problem of optimizing the ratio of two convex functions over a closed and convex set in the space of matrices. In general, the objective function is nonconvex but, nevertheless, the problem has some special features. Taking advantage of these features, a conditional gradient method is proposed and analyzed, which is suitable for matrix problems. Numerical experiments are presented.
0 references
fractional programming
0 references
conditional gradient method
0 references
0 references
0 references
0 references
0 references
