Closures and Neighbourhoods Induced by Tangential Approximations

  • Milan Vlach
Conference paper
Part of the Lecture Notes in Economics and Mathematical Systems book series (LNE, volume 226)

Abstract

We begin with a simple observation that every usual optimization problem is determined by the following two components: a set of “feasible” solutions and a binary relation “better”. The set of all feasible solutions is, as a rule, given through a system of conditions as a subset of a larger set endowed with some structures. The relation better should make a consistent comparison of feasible solutions possible. As a minimal consistency condition we shall require that the relation in question is acyclic.

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Day, M.M.: Convergence, closure and neigbourhoods; Duke Math. J. 11 (1944), 181–199.CrossRefGoogle Scholar
  2. Dolecki, S.: Tangency and differentiation: some applications of convergence theory; Annali di Matematica pura ed applicata (IV), CXXX (1982), 233–255.Google Scholar
  3. Fröhlicher, A. and W. Bucher: Calculus in vector spaces without norm; SpringerVerlag, Berlin (1966).Google Scholar
  4. Hammer, P.C.: Extended topology: structure of isotonic functions; J. Reine Angew. Math. 213 (1964), 174–186.CrossRefGoogle Scholar
  5. Hiriart-Urruty, J.B.: New concepts in nondifferentiable programming; Bull. Soc. Math. France, Mémoire 60 (1979), 57–85.Google Scholar
  6. Lukes, J., J. Malý, D. Preis and L. Zajicek: Fine topology methods in real analysis and potential theory; Lecture Notes in Math., Springer-Verlag (to appear).Google Scholar
  7. Penot, J.P.: Calcul sous-differential et optimisation; J. of Functional Analysis 27 (1978), 248–276.CrossRefGoogle Scholar
  8. Penot, J.P.: A characterization of tangential regularity; Nonlinear Anal. Theory, Math. Appl. 5 (1981), 625–663.CrossRefGoogle Scholar
  9. Rockafellar, R.T.: The theory of subgradients and its applications to problems of optimization: convex and nonconvex functions; Helderman Verlag, Berlin (1981).Google Scholar
  10. Sachs, E.: Differentiability in optimization theory; Math. Operationsforsch. Statist., ser. Optimization 7 (1978), 497–537.CrossRefGoogle Scholar
  11. Saks, S.: Theory of the Integral, second revised edition; Hafner Publ. Co., New York (1937).Google Scholar
  12. Vlach, M.: On necessary conditions of optimality in linear spaces; Comm. Math. Univ. Carolinae 11,1 (1970), 501–513.Google Scholar
  13. Vlach, M.: Approximation operators in optimization theory; Zeitschrift für Operations Research 25 (1981), 15–23.CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1984

Authors and Affiliations

  • Milan Vlach

There are no affiliations available

Personalised recommendations