Point - to - Set Maps and Mathematical Programming

Background to point-to-set maps in mathematical programming

• P. Huard

Annex 1 The continuities of the point-to-set maps, definitions and equivalences

• J. P. Delahaye, J. Denel

Annex 2 Relaxation methods

General reference list

Differentiable stability in non convex and non differentiable programming

• A. Auslender

A multivalued approach to the Farkas lemma

• J. M. Borwein

Extensions of the continuity of point-to-set maps: Applications to fixed point algorithms

• J. Denel

Composition and union of general algorithms of optimization

• J. Ch. Fiorot, P. Huard

Modified Lagrangians in convex programming and their generalizations

• E. G. Gol’shtein, N. V. Tret’yakov

Extensions of Zangwill’s theorem

• P. Huard

On the lower semicontinuity of optimal sets in convex parametric optimization

• D. Klatte

A note on the continuity of the solution set of special dual optimization problems

• B. Kummer

Asymptotic properties of sequences iteratively generated by point-to-set maps

• Gerard G. L. Meyer

Generalized equations and their solutions, Part I: Basic theory

• Stephen M. Robinson

The fixed point approach to nonlinear programming

• R. Saigal

Convergence analysis for two-level algorithms of mathematical programming

• J. Szymanowski, A. Ruszczynski

A comparative study of several general convergence conditions for algorithms modeled by point-to-set maps

• S. Tishyadhigama, E. Polak, R. Klessig