Point - to - Set Maps and Mathematical Programming
| Other Authors: | |
|---|---|
| Format: | eBook |
| Language: | English |
| Published: |
Berlin, Heidelberg
Springer Berlin Heidelberg
1979, 1979
|
| Edition: | 1st ed. 1979 |
| Series: | Mathematical Programming Studies
|
| Subjects: | |
| Online Access: | |
| Collection: | Springer Book Archives -2004 - Collection details see MPG.ReNa |
Table of Contents:
- 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