How to deal with the unbounded in optimization : Theory and algorithms
Auslender, A.

Data: 1997
Resum: 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. .
Drets: Tots els drets reservats.
Llengua: Anglès
Document: Article ; recerca ; Versió publicada
Matèria: Convex and linear programming ; Convex analysis ; Recession functions ; Existence of optimal solutions ; Penalty and barrier methods
Publicat a: Mathematical Programming, vol. 79 n. 1-3 (1997) p. 3-18, ISSN 0025-5610

16 p, 789.7 KB
 Accés restringit a la UAB

El registre apareix a les col·leccions:
Articles > Articles de recerca
Articles > Articles publicats

 Registre creat el 2006-03-13, darrera modificació el 2023-06-03

   Favorit i Compartir