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

DOI10.1080/10556788.2015.1055561zbMATH Open1338.90328OpenAlexW2226354451WikidataQ57659428 ScholiaQ57659428MaRDI QIDQ2811488FDOQ2811488

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

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

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

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)

Cites Work

• Title not available (Why is that?)
• A quadratically convergent method for minimizing a sum of euclidean norms
• Title not available (Why is that?)
• An Efficient Algorithm for Minimizing a Sum of Euclidean Norms with Applications
• Euclidean Shortest Paths
• Watchman routes under limited visibility
• The directed Hausdorff distance between imprecise point sets
• Shortest descending paths through given faces
• Finding shortest safari routes in simple polygons
• The zookeeper route problem
• A smoothing Newton method for minimizing a sum of Euclidean norms
• Approximation of convex functions
• An approximative solution to the Zookeeper's problem
• 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

Cited In (1)

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

Uses Software

• Matlab
• CVX

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)