Point-to-Set Maps and Mathematical Programming

Background To Point-to-set Maps In Mathematical Programming -- Annex 1 The Continuities Of The Point-to-set Maps, Definitions And Equivalences -- Annex 2 Relaxation Methods -- General Reference List -- Differentiable Stability In Non Convex And Non Differentiable Programming -- A Multivalued Approach To The Farkas Lemma -- Extensions Of The Continuity Of Point-to-set Maps: Applications To Fixed Point Algorithms -- Composition And Union Of General Algorithms Of Optimization -- Modified Lagrangians In Convex Programming And Their Generalizations -- Extensions Of Zangwill’s Theorem -- On The Lower Semicontinuity Of Optimal Sets In Convex Parametric Optimization -- A Note On The Continuity Of The Solution Set Of Special Dual Optimization Problems -- Asymptotic Properties Of Sequences Iteratively Generated By Point-to-set Maps -- Generalized Equations And Their Solutions, Part I: Basic Theory -- The Fixed Point Approach To Nonlinear Programming -- Convergence Analysis For Two-level Algorithms Of Mathematical Programming -- A Comparative Study Of Several General Convergence Conditions For Algorithms Modeled By Point-to-set Maps. Edited By P. Huard.