 visitant ::
identificació
|
|||||||||||||||
|
Cerca | Lliura | Ajuda | Servei de Biblioteques | Sobre el DDD | Català English Español | |||||||||
| Pàgina inicial > Articles > Articles publicats > How to deal with the unbounded in optimization : |
| 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 |
 Accés restringit a la UAB |
