Skip to main content

Lower Bounds and Inclusion Balls for the Solution of Locally Uniformly Convex Optimization Problems

  • Conference paper
Optimization and Operations Research

Part of the book series: Lecture Notes in Economics and Mathematical Systems ((LNE,volume 117))

  • 71 Accesses

Abstract

We study the minimization problem f0(x)= min! subject to constraints fi(x)≤ 0,i=1,2,…,k,where each fi=0,1,...,k, is a real convex and subdifferentiable functional on a closed convex set of a reflexive B-space. Supposing that at least one fi,iє{0,1,...,k} is locally uniformly convex,lower bounds for the minimal value of f0 are constructed which do not require the evaluation of the dual functional. It is also shown how in this case an inclusion for the unknown solutions can be obtained.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. J.Céa, Optimisation théorie et algorithmes, Dunod Paris 1971(chap.5).

    Google Scholar 

  2. J.W.Daniel, The approximate minimization of functionals, Prentice-Hall Inc. 1971 (sec. 1. 5–1. 6 ).

    Google Scholar 

  3. J.M.Ortega and W.C. Rheinboldt, Iterative solution of nonlinear equations in several variables, Academic Press New York-London 1970 (ch.3.4, 4.2, 4. 3 ).

    Google Scholar 

  4. P.Wolfe, Convergence theory in nonlinear programming, in J.Abadie, Integer and nonlinear programming, North-Holland Publishing Company Amsterdam-London 1970 (ch.1).

    Google Scholar 

  5. B.Poljak, Existence theorems and convergence of minimizing sequences in extremum problems with restrictions, Dokl.Akad.Nauk SSSR 166, 287–290; Soviet Math.Dok1. 7, 72–75, 1966.

    Google Scholar 

  6. K.Schumacher, Untersuchungen zur Theorie der Gradientenverfahren, Thesis, Tübingen 1974.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1976 Springer-Verlag Berlin · Heidelberg

About this paper

Cite this paper

Schumacher, K. (1976). Lower Bounds and Inclusion Balls for the Solution of Locally Uniformly Convex Optimization Problems. In: Oettli, W., Ritter, K. (eds) Optimization and Operations Research. Lecture Notes in Economics and Mathematical Systems, vol 117. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-46329-7_24

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-46329-7_24

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-07616-2

  • Online ISBN: 978-3-642-46329-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics