Digital Object Identifier (DOI) 10.1007/s10107-006-0003-6

The question of nonemptiness of the intersection of a nested sequence of closed sets is fundamental in a number of important optimization topics, including the existence of optimal solutions, the validity of the minimax inequality in zero sum games, and the absence of a duality gap in constrained optimization. We consider asymptotic directions of a sequence of closed sets, and introduce associated notions of retractive, horizon, and critical directions, based on which we provide new conditions that guarantee the nonemptiness of the corresponding intersection. We show how these conditions can be used to obtain simple and unified proofs of some known results on existence of optimal solutions, and to derive some new results, including a new extension of the Frank–Wolfe Theorem for (nonconvex) quadratic programming.

[1]  G. G. Stokes "J." , 1890, The New Yale Book of Quotations.

[2]  E. Helly Über Systeme linearer Gleichungen mit unendlich vielen Unbekannten , 1921 .

[3]  W. Fenchel Convex cones, sets, and functions , 1953 .

[4]  Philip Wolfe,et al.  An algorithm for quadratic programming , 1956 .

[5]  R. Rockafellar Ordinary convex programs without a duality gap , 1971 .

[6]  Werner Oettli,et al.  Technical Note - Direct Proof of the Existence Theorem for Quadratic Programming , 1972, Oper. Res..

[7]  丸山 徹 Convex Analysisの二,三の進展について , 1977 .

[8]  J. Dedieu Cônes asymptotes d'ensembles non convexes , 1979 .

[9]  André F. Perold A generalization of the Frank—Wolfe theorem , 1980, Math. Program..

[10]  R. Mandel Über die existenz von lösungen ganzzahliger optimierungsaufgaben , 1981 .

[11]  Mathematical Research , 1981 .

[12]  B. Bank,et al.  Stability of mixed-integer quadratic programming problems , 1984 .

[13]  T. Terlaky On lp programming , 1985 .

[14]  B. Bank,et al.  Parametric Integer Optimization , 1988 .

[15]  Alfred Auslender,et al.  Noncoercive Optimization Problems , 1996, Math. Oper. Res..

[16]  Z. Luo,et al.  On the extensions of Frank-Wolfe theorem , 1997 .

[17]  Alfred Auslender How to deal with the unbounded in optimization: Theory and algorithms , 1997, Math. Program..

[18]  Zhi-Quan Luo,et al.  On Extensions of the Frank-Wolfe Theorems , 1999, Comput. Optim. Appl..

[19]  Alfred Auslender,et al.  Existence of optimal solutions and duality results under weak conditions , 2000, Math. Program..

[20]  M. Teboulle,et al.  Asymptotic cones and functions in optimization and variational inequalities , 2002 .

[21]  Diethard Klatte,et al.  A Frank–Wolfe Type Theorem for Convex Polynomial Programs , 2002, Comput. Optim. Appl..

[22]  A. Ozdaglar,et al.  Existence of Global Minima for Constrained Optimization , 2006 .

[23]  A. Banerjee Convex Analysis and Optimization , 2006 .

[24]  Gábor Pataki,et al.  On the Closedness of the Linear Image of a Closed Convex Cone , 2007, Math. Oper. Res..