Skip to main content

An accuracy selection algorithm for the modified gradient projection method in minimax problems

  • Nonlinear And Stochastic Programming
  • Conference paper
  • First Online:
Optimization Techniques

Part of the book series: Lecture Notes in Control and Information Sciences ((LNCIS,volume 7))

  • 160 Accesses

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

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. A. Auslender: "Minimization of convex functions with errors", IX International Symposium on Mathematical Programming, Budapest 1976.

    Google Scholar 

  2. D. Bertsekas: "On the Goldstein-Levitin-Polyak gradient projection method", IEEE Tran. Aut.Contr., April 1976, vol. AC-21, No-2

    Google Scholar 

  3. J. Szymanowski, A. RuszczyƄski: "Convergence analysis for two-level algorithms of mathematical programming", International Symposium on Mathematical Programming, Budapest 1976.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

J. Stoer

Rights and permissions

Reprints and permissions

Copyright information

© 1978 Springer-Verlag

About this paper

Cite this paper

Szymanowski, J., RuszczyƄski, A. (1978). An accuracy selection algorithm for the modified gradient projection method in minimax problems. In: Stoer, J. (eds) Optimization Techniques. Lecture Notes in Control and Information Sciences, vol 7. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0006521

Download citation

  • DOI: https://doi.org/10.1007/BFb0006521

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-08708-3

  • Online ISBN: 978-3-540-35890-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics