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 the normal view instead:
scientific article; zbMATH DE number 6852052
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
0.7490878701210022
0 references
0.7464951872825623
0 references
0.739417552947998
0 references
0.7384873032569885
0 references
0.7376642227172852
0 references
