Repositorio de producción científica de la Universidad de Sevilla

Dominating sets for convex functions with some applications

 

Advanced Search
 
Opened Access Dominating sets for convex functions with some applications
Cites

Show item statistics
Icon
Export to
Author: Carrizosa Priego, Emilio José
Frenk, Johannes B. G.
Department: Universidad de Sevilla. Departamento de Estadística e Investigación Operativa
Date: 1998-02
Published in: Journal of Optimization Theory and Applications, 96 (2), 281-295.
Document type: Article
Abstract: 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.
Cite: 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.
Size: 222.8Kb
Format: PDF

URI: http://hdl.handle.net/11441/44836

DOI: 10.1023/A:1022614029984

See editor´s version

This work is under a Creative Commons License: 
Attribution-NonCommercial-NoDerivatives 4.0 Internacional

This item appears in the following Collection(s)