Point-to-Set Maps and Mathematical Programming
By: edited by P. Huard
Series: Mathematical Programming Studies -- 10; Mathematical programming study -- 10.
Publisher: Springer Berlin Heidelberg
Published: 1979
Place of publication: Berlin, Heidelberg
Language: eng
ISBN-13: 9783642007989; 9783642007972
Subjects: Mathematics; Computer science; Mathematical optimization; Mathematics of Computing; Optimization
Table of contents: title: Background to point-to-set maps in mathematical programming; title: Annex 1 The continuities of the point-to-set maps, definitions and equivalences; title: Annex 2 Relaxation methods; title: General reference list; title: Differentiable stability in non convex and non differentiable programming; title: A multivalued approach to the Farkas lemma; title: Extensions of the continuity of point-to-set maps: Applications to fixed point algorithms; title: Composition and union of general algorithms of optimization; title: Modified Lagrangians in convex programming and their generalizations; title: Extensions of Zangwill’s theorem; title: On the lower semicontinuity of optimal sets in convex parametric optimization; title: A note on the continuity of the solution set of special dual optimization problems; title: Asymptotic properties of sequences iteratively generated by point-to-set maps; title: Generalized equations and their solutions, Part I: Basic theory; title: The fixed point approach to nonlinear programming; title: Convergence analysis for two-level algorithms of mathematical programming; title: A comparative study of several general convergence conditions for algorithms modeled by point-to-set maps.