Average-distance problem for parameterized curves
From MaRDI portal
Publication:2808050
DOI10.1051/cocv/2015011zbMath1338.49094arXiv1411.2673OpenAlexW2009667234MaRDI QIDQ2808050
Publication date: 26 May 2016
Published in: ESAIM: Control, Optimisation and Calculus of Variations (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1411.2673
Smoothness and regularity of solutions to PDEs (35B65) Variational problems in a geometric measure-theoretic setting (49Q20) Regularity of solutions in optimal control (49N60) Optimization of shapes other than minimal surfaces (49Q10) Optimality conditions for free problems in two or more independent variables (49K10)
Related Items (3)
Multiple penalized principal curves: analysis and computation ⋮ On principal curves with a length constraint ⋮ Average-distance problem with curvature penalization for data parameterization: regularity of minimizers
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Optimal urban networks via mass transportation
- The Steiner tree problem
- A presentation of the average distance minimizing problem
- Hamilton-Jacobi equations and distance functions on Riemannian manifolds
- Counterexample to regularity in average-distance problem
- Blow-up of optimal sets in the irrigation problem
- Properties of Minimizers of Average-Distance Problem via Discrete Approximation of Measures
- A Mass Transportation Model for the Optimal Planning of an Urban Region
- Qualitative Properties of Maximum Distance Minimizers and Average Distance Minimizers in \mathbb Rn
- 10.1162/15324430152748227
- Principal Curves
- Stationary configurations for the average distance functional and related problems
- Optimal Pricing Policies for Public Transportation Networks
- Steiner Minimal Trees
This page was built for publication: Average-distance problem for parameterized curves
