A presentation of the average distance minimizing problem
From MaRDI portal
Publication:1762540
DOI10.1007/S10958-012-0717-3zbMath1253.49037OpenAlexW2083110101MaRDI QIDQ1762540
Publication date: 27 November 2012
Published in: Journal of Mathematical Sciences (New York) (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10958-012-0717-3
optimal transportweak regularityAhlfors regularitypenalized problem\(C^{1,1}\)-regularityaverage distance minimization
Variational problems in a geometric measure-theoretic setting (49Q20) Optimal stochastic control (93E20) Regularity of solutions in optimal control (49N60)
Related Items (8)
The average-distance problem with an Euler elastica penalization ⋮ The Average Distance Problem with Perimeter-to-Area Ratio Penalization ⋮ Dirichlet conditions in Poincaré-Sobolev inequalities: the sub-homogeneous case ⋮ Regularity of densities in relaxed and penalized average distance problem ⋮ On principal curves with a length constraint ⋮ Regularity for the Optimal Compliance Problem with Length Penalization ⋮ Average-distance problem for parameterized curves ⋮ One-dimensional approximation of measures in Wasserstein distance
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Old friends revisited: The multifractal nature of some classical functions
- Asymptotical compliance optimization for connected networks
- Optimal urban networks via mass transportation
- Blow-up of optimal sets in the irrigation problem
- Optimal convex shapes for concave functionals
- Qualitative Properties of Maximum Distance Minimizers and Average Distance Minimizers in \mathbb Rn
- The Realization of small Distances in Plane Sets of Positive Measure
- ( M , ɛ, δ)-Minimal Curve Regularity
- On convex sets that minimize the average distance
- Stationary configurations for the average distance functional and related problems
This page was built for publication: A presentation of the average distance minimizing problem
