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

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1080/10556788.2015.1055561 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2226354451 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Shortest descending paths through given faces / rank
 
Normal rank
Property / cites work
 
Property / cites work: The zookeeper route problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An approximative solution to the Zookeeper's problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The directed Hausdorff distance between imprecise point sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation of convex functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Euclidean Shortest Paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: Watchman routes under limited visibility / rank
 
Normal rank
Property / cites work
 
Property / cites work: A quadratically convergent method for minimizing a sum of euclidean norms / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Smoothing Newton Method for Minimizing a Sum of Euclidean Norms / rank
 
Normal rank
Property / cites work
 
Property / cites work: A primal-dual algorithm for minimizing a sum of Euclidean norms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4235027 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4115333 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding shortest safari routes in simple polygons / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Efficient Algorithm for Minimizing a Sum of Euclidean Norms with Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: A quadratically convergent method for minimizing a sum of Euclidean norms with linear constraints / rank
 
Normal rank

Latest revision as of 03:11, 12 July 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
    0 references
    0 references

    Identifiers

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