Artículo
Dominating sets for convex functions with some applications
Autor/es | Carrizosa Priego, Emilio José
Frenk, Johannes B. G. |
Departamento | Universidad de Sevilla. Departamento de Estadística e Investigación Operativa |
Fecha de publicación | 1998-02 |
Fecha de depósito | 2016-09-08 |
Publicado en |
|
Resumen | A number of optimization methods require as a rst step the construction
of a dominating set (a set containing an optimal solution) enjoying properties such as compactness or convexity. In this note we address the problem ... A number of optimization methods require as a rst step the construction of a dominating set (a set containing an optimal solution) enjoying properties such as compactness or convexity. In this note we address the problem of constructing dominating sets for problems whose ob jective is a componentwise nondecreasing function of (possibly an in nite number of ) convex functions, and we show how to obtain a convex dominating set in terms of dominating sets of simpler problems. The applicability of the results obtained is illustrated with the statement of new localization results in the elds of Linear Regression and Location. |
Agencias financiadoras | Dirección General de Investigación Científica y Técnica (DGICYT). España |
Identificador del proyecto | PB93-0927 |
Cita | Carrizosa Priego, E.J. y Frenk, J.B.G. (1998). Dominating sets for convex functions with some applications. Journal of Optimization Theory and Applications, 96 (2), 281-295. |
Ficheros | Tamaño | Formato | Ver | Descripción |
---|---|---|---|---|
Dominating sets for convex ... | 222.8Kb | [PDF] | Ver/ | |