Average-distance problem for parameterized curves

DOI10.1051/COCV/2015011zbMATH Open1338.49094arXiv1411.2673OpenAlexW2009667234MaRDI QIDQ2808050FDOQ2808050

Authors: Xin Yang Lu, Dejan Slepčev 

Publication date: 26 May 2016

Published in: European Series in Applied and Industrial Mathematics (ESAIM): Control, Optimization and Calculus of Variations (Search for Journal in Brave)

Abstract: We consider approximating a measure by a parameterized curve subject to length penalization. That is for a given finite positive compactly supported measure $mu$, for $pgeq1$ and $lambda>0$ we consider the functional [ E(gamma) = int_{mathbb{R}^d} d(x, Gamma_gamma)^p dmu(x) + lambda , extrm{Length}(gamma) ] where $gamma:Iomathbb{R}^d$, $I$ is an interval in $mathbbR$, $Gamm{a}_{g}amma=gamma(I)$, and $d(x,Gamm{a}_{g}amma)$ is the distance of $x$ to $Gamm{a}_{g}amma$. The problem is closely related to the average-distance problem, where the admissible class are the connected sets of finite Hausdorff measure $mathcal{H}^1$, 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 $mu$ supported in two dimensions the minimizing curve is injective if $pgeq2$ or if $mu$ 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.

Full work available at URL: https://arxiv.org/abs/1411.2673

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

zbMATH Keywords

regularityprincipal curvesnonlocal variational problemsaverage-distance problem

Mathematics Subject Classification ID

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)

Cites Work

• Principal Curves
• A first course in Sobolev spaces
• Hamilton-Jacobi equations and distance functions on Riemannian manifolds
• The Steiner tree problem
• Steiner Minimal Trees
• A Mass Transportation Model for the Optimal Planning of an Urban Region
• Optimal urban networks via mass transportation
• 10.1162/15324430152748227
• Title not available (Why is that?)
• Title not available (Why is that?)
• Optimal Pricing Policies for Public Transportation Networks
• Optimal transportation networks as free Dirichlet for the Monge-Kantorovich problem
• Blow-up of optimal sets in the irrigation problem
• A presentation of the average distance minimizing problem
• Counterexample to regularity in average-distance problem
• Properties of minimizers of average-distance problem via discrete approximation of measures
• Qualitative Properties of Maximum Distance Minimizers and Average Distance Minimizers in \mathbb Rⁿ
• Title not available (Why is that?)
• Stationary configurations for the average distance functional and related problems
• About the regularity of average distance minimizers in \(\mathbb R^{2}\)

Cited In (4)

• On principal curves with a length constraint
• Average-distance problem with curvature penalization for data parameterization: regularity of minimizers
• One-dimensional approximation of measures in Wasserstein distance
• 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)