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

DOI10.1080/10556788.2015.1055561MaRDI QIDQ2811488zbMATH OpenOpenAlexWikidataFDO

Authors Le Hong Trang, Attila Kozma, Phan Thanh An, Markus Diehl

Publication date 10 June 2016

Published in Optimization Methods \& Software (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/10556788.2015.1055561

zbMATH Keywords

shortest pathrelaxationnon-convex constraintminimizing a sum of Euclidean normssequentialconvex programming

Mathematics Subject Classification ID

General topics in the theory of software (68N01) Approximation methods and heuristics in mathematical programming (90C59) Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30) General topics of discrete mathematics in relation to computer science (68R01)

Recommendations

• An Efficient Algorithm for Minimizing a Sum of Euclidean Norms with Applications
• An exact algorithm for minimizing a sum of Euclidean norms on rays in 2D and 3D
• Approximate Euclidean shortest paths amid convex obstacles
• Shortest polygonal paths in space
• scientific article; zbMATH DE number 4066632

Cites work

• scientific article; zbMATH DE number 3539473 (Why is no real title available?)
• scientific article; zbMATH DE number 1266748 (Why is no real title available?)
• A primal-dual algorithm for minimizing a sum of Euclidean norms
• A quadratically convergent method for minimizing a sum of Euclidean norms with linear constraints
• A quadratically convergent method for minimizing a sum of euclidean norms
• A smoothing Newton method for minimizing a sum of Euclidean norms
• An Efficient Algorithm for Minimizing a Sum of Euclidean Norms with Applications
• An approximative solution to the Zookeeper's problem
• Approximation of convex functions
• Euclidean shortest paths. Exact or approximate algorithms.
• Finding shortest safari routes in simple polygons
• Shortest descending paths through given faces
• The directed Hausdorff distance between imprecise point sets
• The zookeeper route problem
• Watchman routes under limited visibility

Cited in

(1)

• An efficient parallel scheme for minimizing a sum of Euclidean norms

Describes a project that uses

Uses Software

• CVX
• Matlab

This page was built for publication: A sequential convex programming algorithm for minimizing a sum of Euclidean norms with non-convex constraints

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2811488)