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

DOI10.1080/10556788.2015.1055561zbMath1338.90328OpenAlexW2226354451WikidataQ57659428 ScholiaQ57659428MaRDI QIDQ2811488

No author found.

Publication date: 10 June 2016

Published in: Optimization Methods and 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 of discrete mathematics in relation to computer science (68R01) Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30) Approximation methods and heuristics in mathematical programming (90C59) General topics in the theory of software (68N01)

Uses Software

• Matlab
• CVX

Cites Work

• Unnamed Item
• Unnamed Item
• The directed Hausdorff distance between imprecise point sets
• Finding shortest safari routes in simple polygons
• An approximative solution to the Zookeeper's problem
• Shortest descending paths through given faces
• Watchman routes under limited visibility
• The zookeeper route problem
• Approximation of convex functions
• A quadratically convergent method for minimizing a sum of Euclidean norms with linear constraints
• A Smoothing Newton Method for Minimizing a Sum of Euclidean Norms
• Euclidean Shortest Paths
• A quadratically convergent method for minimizing a sum of euclidean norms
• An Efficient Algorithm for Minimizing a Sum of Euclidean Norms with Applications
• A primal-dual algorithm for minimizing a sum of Euclidean norms