Average-distance problem for parameterized curves
From MaRDI portal
Publication:2808050
Variational problems in a geometric measure-theoretic setting (49Q20) Smoothness and regularity of solutions to PDEs (35B65) 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)
Abstract: We consider approximating a measure by a parameterized curve subject to length penalization. That is for a given finite positive compactly supported measure , for and we consider the functional [ E(gamma) = int_{mathbb{R}^d} d(x, Gamma_gamma)^p dmu(x) + lambda , extrm{Length}(gamma) ] where , is an interval in , , and is the distance of to . The problem is closely related to the average-distance problem, where the admissible class are the connected sets of finite Hausdorff measure , and to (regularized) principal curves studied in statistics. We obtain regularity of minimizers in the form of estimates on the total curvature of the minimizers. We prove that for measures supported in two dimensions the minimizing curve is injective if or if has bounded density. This establishes that the minimization over parameterized curves is equivalent to minimizing over embedded curves and thus confirms that the problem has a geometric interpretation.
Recommendations
- Average-distance problem with curvature penalization for data parameterization: regularity of minimizers
- Regularity of densities in relaxed and penalized average distance problem
- Counterexample to regularity in average-distance problem
- Properties of minimizers of average-distance problem via discrete approximation of measures
- On principal curves with a length constraint
Cites work
- scientific article; zbMATH DE number 1996419 (Why is no real title available?)
- scientific article; zbMATH DE number 2159262 (Why is no real title available?)
- scientific article; zbMATH DE number 850150 (Why is no real title available?)
- 10.1162/15324430152748227
- A first course in Sobolev spaces
- A presentation of the average distance minimizing problem
- About the regularity of average distance minimizers in \(\mathbb R^{2}\)
- Blow-up of optimal sets in the irrigation problem
- Counterexample to regularity in average-distance problem
- Hamilton-Jacobi equations and distance functions on Riemannian manifolds
- Optimal Pricing Policies for Public Transportation Networks
- Optimal transportation networks as free Dirichlet for the Monge-Kantorovich problem
- Optimal urban networks via mass transportation
- Principal Curves
- Properties of minimizers of average-distance problem via discrete approximation of measures
- Qualitative Properties of Maximum Distance Minimizers and Average Distance Minimizers in \mathbb Rn
- Stationary configurations for the average distance functional and related problems
- Steiner Minimal Trees
- The Steiner tree problem
Cited in
(7)- Properties of minimizers of average-distance problem via discrete approximation of measures
- Regularity of densities in relaxed and penalized average distance problem
- One-dimensional approximation of measures in Wasserstein distance
- On principal curves with a length constraint
- Counterexample to regularity in average-distance problem
- Average-distance problem with curvature penalization for data parameterization: regularity of minimizers
- Multiple penalized principal curves: analysis and computation
This page was built for publication: Average-distance problem for parameterized curves
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2808050)