Minsum location extended to gauges and to convex sets

DOI10.1007/s10957-014-0692-6zbMath1329.52010arXiv1410.3690OpenAlexW3103205099MaRDI QIDQ495723

Thomas Jahn, Horst Martini, Yaakov S. Kupitz, Christian Richter

Publication date: 15 September 2015

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

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

zbMATH Keywords

Hahn-Banach theoremoptimality conditionsdualityMinkowski spaceSteiner problempolarityconvex programgaugeFermat-Torricelli problemgeneralized \(d\)-segments

Mathematics Subject Classification ID

Convex programming (90C25) Continuous location (90B85) Optimality conditions and duality in mathematical programming (90C46) Geometry and structure of normed linear spaces (46B20) Theorems of Hahn-Banach type; extension and lifting of functionals and operators (46A22) Convex functions and convex programs in convex geometry (52A41) Applications of functional analysis in optimization, convex analysis, mathematical programming, economics (46N10) Duality theory (optimization) (49N15) Convexity and finite-dimensional Banach spaces (including special norms, zonoids, etc.) (aspects of convex geometry) (52A21) Convex sets in (n) dimensions (including convex hypersurfaces) (52A20) Optimality conditions for free problems in two or more independent variables (49K10)

Related Items (9)

The log-exponential smoothing technique and Nesterov's accelerated gradient method for generalized Sylvester problems ⋮ Solving a continuous multifacility location problem by DC algorithms ⋮ Minkowski Geometry—Some Concepts and Recent Developments ⋮ On Newton's method for the Fermat-Weber location problem ⋮ A generalization of the concept of distance based on the simplex inequality ⋮ Minimizing differences of convex functions with applications to facility location and clustering ⋮ Coproximinality of linear subspaces in generalized Minkowski spaces ⋮ Solving \(k\)-center problems involving sets based on optimization techniques ⋮ Orthogonality in Generalized Minkowski Spaces

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The Fermat-Torricelli problem. I: A discrete gradient-method approach
• Applications of variational analysis to a generalized Fermat-Torricelli problem
• A destination optimality in asymmetric distance Fermat-Weber problems
• Minsum hyperspheres in normed spaces
• Compactness and finite dimension in asymmetric normed linear spaces
• Quotient subspaces of asymmetric normed linear spaces
• Geometrical properties of the Fermat-Weber problem
• Geometric methods and optimization problems
• Weber's problem with attraction and repulsion under polyhedral gauges
• The Fermat--Torricelli problem in normed planes and spaces
• Constructions of solutions to generalized Sylvester and Fermat-Torricelli problems for Euclidean balls
• Excursions into combinatorial geometry
• Solution of the Multisource Weber and Conditional Weber Problems by D.-C. Programming
• A D.C. Algorithm via Convex Analysis Approach for Solving a Location Problem Involving Sets
• A Generalized Sylvester Problem and a Generalized Fermat-Torricelli Problem
• Convex analysis and optimization in Hadamard spaces
• Functional Analysis in Asymmetric Normed Spaces
• Solving a Generalized Heron Problem by Means of Convex Analysis
• Subgradients of Minimal Time Functions Under Minimal Requirements
• Applications of variational analysis to a generalized Heron problem
• State Constraints in Convex Control Problems of Bolza
• Convex analysis and monotone operator theory in Hilbert spaces
• Functional analysis
• The geometry of Minkowski spaces -- a survey. I
• Median and center hyperplanes in Minkowski spaces -- a unified approach

This page was built for publication: Minsum location extended to gauges and to convex sets