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

Date: 1997
Abstract: 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. .
Rights: Tots els drets reservats.
Language: Anglès
Document: Article ; recerca ; Versió publicada
Subject: Convex and linear programming ; Convex analysis ; Recession functions ; Existence of optimal solutions ; Penalty and barrier methods
Published in: Mathematical Programming, vol. 79 n. 1-3 (1997) p. 3-18, ISSN 0025-5610



16 p, 789.7 KB
 UAB restricted access

The record appears in these collections:
Articles > Research articles
Articles > Published articles

 Record created 2006-03-13, last modified 2023-06-03



   Favorit i Compartir