An Exact Algorithm for Minimizing a Sum of Euclidean Norms on Rays in 2D and 3D

DOI10.1080/01630563.2015.1013549zbMath1416.65063OpenAlexW2010664348WikidataQ57659430 ScholiaQ57659430MaRDI QIDQ5264005

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

zbMATH Keywords

convex optimizationconvex setssimple polygonsshortest pathssum 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

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

This page was built for publication: An Exact Algorithm for Minimizing a Sum of Euclidean Norms on Rays in 2D and 3D