Applications of variational analysis to a generalized heron problem
From MaRDI portal
Abstract: This paper is a continuation of our ongoing efforts to solve a number of geometric problems and their extensions by using advanced tools of variational analysis and generalized differentiation. Here we propose and study, from both qualitative and numerical viewpoints, the following optimal location problem as well as its further extensions: on a given nonempty subset of a Banach space, find a point such that the sum of the distances from it to given nonempty subsets of this space is minimal. This is a generalized version of the classical Heron problem: on a given straight line, find a point C such that the sum of the distances from C to the given points A and B is minimal. We show that the advanced variational techniques allow us to completely solve optimal location problems of this type in some important settings.
Recommendations
- Applications of variational analysis to a generalized Fermat-Torricelli problem
- Solving a generalized Heron problem by means of convex analysis
- A Look at the Generalized Heron Problem through the Lens of Majorization-Minimization
- Minsum location extended to gauges and to convex sets
- Variational analysis of directional minimal time functions and applications to location problems
Cites work
- An Approach to Location Models Involving Sets as Existing Facilities
- Applications of variational analysis to a generalized Fermat-Torricelli problem
- Limiting subgradients of minimal time functions in Banach spaces
- Metric projections and the differentiability of distance functions
- Solving a generalized Heron problem by means of convex analysis
Cited in
(20)- An MM Algorithm for Split Feasibility Problems
- Minimal time functions and the smallest intersecting ball problem with unbounded dynamics
- Convergence analysis of two-step inertial Douglas-Rachford algorithm and application
- A product space reformulation with reduced dimension for splitting algorithms
- The smallest enclosing ball problem and the smallest intersecting ball problem: existence and uniqueness of solutions
- A parameterized Douglas-Rachford algorithm
- Solving a generalized Heron problem by means of convex analysis
- Inertial Douglas-Rachford splitting for monotone inclusion problems
- Distance majorization and its applications
- Minsum location extended to gauges and to convex sets
- Incremental proximal gradient scheme with penalization for constrained composite convex optimization problems
- scientific article; zbMATH DE number 7201304 (Why is no real title available?)
- The plasticity of non-overlapping convex sets in \(\mathbb{R}^2\)
- Applications of variational analysis to a generalized Fermat-Torricelli problem
- A Look at the Generalized Heron Problem through the Lens of Majorization-Minimization
- The minimal time function associated with a collection of sets
- Two proximal splitting methods in Hadamard spaces
- The boosted double-proximal subgradient algorithm for nonconvex optimization
- Accelerated iterative splitting methods on Hadamard manifolds
- Efficient Douglas-Rachford methods on Hadamard manifolds with applications to the Heron problems
This page was built for publication: Applications of variational analysis to a generalized heron problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3143366)