A sequential convex programming algorithm for minimizing a sum of Euclidean norms with non-convex constraints (Q2811488)

From MaRDI portal
Revision as of 03:11, 12 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
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
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references