A sequential convex programming algorithm for minimizing a sum of Euclidean norms with non-convex constraints (Q2811488): Difference between revisions
From MaRDI portal
Changed an Item |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 08:37, 5 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A sequential convex programming algorithm for minimizing a sum of Euclidean norms with non-convex constraints |
scientific article |
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
