A novel convex relaxation-strategy-based algorithm for solving linear multiplicative problems (Q2075981)
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: A novel convex relaxation-strategy-based algorithm for solving linear multiplicative problems |
scientific article; zbMATH DE number 7474416
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A novel convex relaxation-strategy-based algorithm for solving linear multiplicative problems |
scientific article; zbMATH DE number 7474416 |
Statements
A novel convex relaxation-strategy-based algorithm for solving linear multiplicative problems (English)
0 references
16 February 2022
0 references
global convergence
0 references
convex relaxation
0 references
branch and bound
0 references
LMP
0 references
complexity
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.8955147
0 references
0.8922367
0 references
0.88965744
0 references
0.8841753
0 references
