How to deal with the unbounded in optimization : Theory and algorithms

Fecha:	1997
Resumen:	The aim of this survey is to show how the unbounded arises in optimization problems and how it leads to fundamental notions which are not only useful for proving theoretical results such as convergence of algorithms and the existence of optimal solutions, but also for constructing new methods. .
Derechos:	Tots els drets reservats.
Lengua:	Anglès
Documento:	Article ; recerca ; Versió publicada
Materia:	Convex and linear programming ; Convex analysis ; Recession functions ; Existence of optimal solutions ; Penalty and barrier methods
Publicado en:	Mathematical Programming, vol. 79 n. 1-3 (1997) p. 3-18, ISSN 0025-5610

16 p, 789.7 KB

Acceso restringido a la UAB

Registro creado el 2006-03-13, última modificación el 2023-06-03