How to deal with the unbounded in optimization: Theory and algorithms
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. (C) 1997 The Mathematical Programming Society, Inc. Published by Elsevier Science B.V.
existence of optimal solutions convex and linear programming convex analysis recession functions penalty and barrier methods