An exact algorithm for minimizing a sum of Euclidean norms on rays in 2D and 3D

DOI10.1080/01630563.2015.1013549zbMATH Open1416.65063OpenAlexW2010664348WikidataQ57659430 ScholiaQ57659430MaRDI QIDQ5264005FDOQ5264005

Phan Thanh An, D. T. Giang, Le Hong Trang

Publication date: 20 July 2015

Published in: Numerical Functional Analysis and Optimization (Search for Journal in Brave)

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

Recommendations

• An Efficient Algorithm for Minimizing a Sum of Euclidean Norms with Applications
• On the optimality conditions for the problem of minimizing a sum of euclidean norms
• An Efficient Algorithm for Minimizing a Sum of p-Norms
• A quadratically convergent method for minimizing a sum of Euclidean norms with linear constraints
• A primal-dual algorithm for minimizing a sum of Euclidean norms

zbMATH Keywords

convex optimizationshortest pathsconvex setssimple polygonssum of Euclidean normsmethod of orienting curvesconvex ropes

Mathematics Subject Classification ID

Numerical optimization and variational techniques (65K10) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)

Cites Work

• A quadratically convergent method for minimizing a sum of euclidean norms
• An efficient algorithm for determining the convex hull of a finite planar set
• Applications of second-order cone programming
• An Efficient Algorithm for Minimizing a Sum of Euclidean Norms with Applications
• Computational Geometry in C
• On the identification of the convex hull of a finite set of points in the plane
• An efficient convex hull algorithm for finite point sets in 3D based on the Method of Orienting Curves
• Ein konstruktives lösungsverfahren für das roblem des inpolygons kleinsten Umfangs Von J Steiner
• Shortest polygonal paths in space
• Method of orienting curves for solving optimal control problems with state constraints¹
• Zur lösung einer regulären aufgabenklasse der optimalen steuerung im groβen mittels orientierungskurven
• Method of orienting curves for determining the convex hull of a finite set of points in the plane

Cited In (2)

• A Newton acceleration of the Weiszfeld algorithm for minimizing the sum of Euclidean distances
• A VLSI algorithm for computing the Euclidean norm of a 3D vector

This page was built for publication: An exact algorithm for minimizing a sum of Euclidean norms on rays in 2D and 3D

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