A sequential convex programming algorithm for minimizing a sum of Euclidean norms with non-convex constraints (Q2811488)
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 sequential convex programming algorithm for minimizing a sum of Euclidean norms with non-convex constraints |
scientific article; zbMATH DE number 6592132
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A sequential convex programming algorithm for minimizing a sum of Euclidean norms with non-convex constraints |
scientific article; zbMATH DE number 6592132 |
Statements
A sequential convex programming algorithm for minimizing a sum of Euclidean norms with non-convex constraints (English)
0 references
10 June 2016
0 references
minimizing a sum of Euclidean norms
0 references
non-convex constraint
0 references
relaxation
0 references
sequentialconvex programming
0 references
shortest path
0 references
0.75408935546875
0 references
0.7422848343849182
0 references
0.7298728823661804
0 references
0.7137212753295898
0 references
