Dominating sets for convex functions with some applications
type: Item
instance of: scholarly article
title: Dominating sets for convex functions with some applications
zbMATH Open document ID: 0905.90134
DOI: 10.1023/A:1022614029984
author: J. B. G. Frenk
author: Emilio Carrizosa
published in: Journal of Optimization Theory and Applications
publication date: 1998-09-14T00:00:00Z
Mathematics Subject Classification ID: 90C25
Mathematics Subject Classification ID: 90B85
zbMATH DE Number: 1164210
zbMATH Keywords: convexity
zbMATH Keywords: dominating sets
zbMATH Keywords: linear regression
zbMATH Keywords: location
MaRDI profile type: Publication
cites work: The minimization of lower subdifferentiable functions under nonlinear constraints: An all feasible cutting plane algorithm
cites work: A deep cut ellipsoid algorithm for convex programming: Theory and applications
cites work: Q4257420
cites work: Quasiconvex optimization and location theory
cites work: Q4889854
cites work: Localization in single facility location
cites work: Location Theory, Dominance, and Convexity
cites work: Q4695312
cites work: State Constraints in Convex Control Problems of Bolza
cites work: Perfect duality for convexlike programs
cites work: Q4764328
cites work: Pareto-optimality in linear regression
cites work: Solving general continuous single facility location problems by cutting planes
cites work: Sets of efficient points in a normed space
cites work: Technical Note—Location Theory, Dominance, and Convexity: Some Further Results
cites work: Hull properties in location problems
cites work: The Minisum and Minimax Location Problems Revisited
cites work: GBSSS: The generalized big square small square method for planar single- facility location
cites work: Geometrical properties of the Fermat-Weber problem
cites work: El conjunto eficiente en problemas de localizacion con normas mixtas (L p)
description: scientific article; zbMATH DE number 1164210