Skip to main content
SpringerLink
Log in

Point - to - Set Maps and Mathematical Programming

  • Book
  • © 1979

Overview

Editors:
  1. P. Huard
    View editor publications

    You can also search for this editor in PubMed   Google Scholar

Part of the book series: Mathematical Programming Studies (MATHPROGRAMM, volume 10)

This is a preview of subscription content, log in via an institution to check access.

Access this book

Log in via an institution

Other ways to access

Licence this eBook for your library

Institutional subscriptions

Table of contents (17 chapters)

  1. Front Matter

    Download chapter PDF

  2. Background to point-to-set maps in mathematical programming

    • P. Huard
    Pages 1-7

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

    • J. P. Delahaye, J. Denel
    Pages 8-12

  4. Annex 2 Relaxation methods

    Pages 13-13

  5. General reference list

    Pages 14-28

  6. Differentiable stability in non convex and non differentiable programming

    • A. Auslender
    Pages 29-41

  7. A multivalued approach to the Farkas lemma

    • J. M. Borwein
    Pages 42-47

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

    • J. Denel
    Pages 48-68

  9. Composition and union of general algorithms of optimization

    • J. Ch. Fiorot, P. Huard
    Pages 69-85

  10. Modified Lagrangians in convex programming and their generalizations

    • E. G. Gol’shtein, N. V. Tret’yakov
    Pages 86-97

  11. Extensions of Zangwill’s theorem

    • P. Huard
    Pages 98-103

  12. On the lower semicontinuity of optimal sets in convex parametric optimization

    • D. Klatte
    Pages 104-109

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

    • B. Kummer
    Pages 110-114

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

    • Gerard G. L. Meyer
    Pages 115-127

  15. Generalized equations and their solutions, Part I: Basic theory

    • Stephen M. Robinson
    Pages 128-141

  16. The fixed point approach to nonlinear programming

    • R. Saigal
    Pages 142-157

  17. Convergence analysis for two-level algorithms of mathematical programming

    • J. Szymanowski, A. Ruszczynski
    Pages 158-171

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

    • S. Tishyadhigama, E. Polak, R. Klessig
    Pages 172-190
Back to top

Keywords

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation