Skip to main content

Algorithms for the solution of a discrete minimax problem: Subgradient methods and a new fast newton — Method

  • Mathematical Programming: Algorithms
  • Conference paper
  • First Online:
Optimization Techniques

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

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. Bandler, Charalambous: " Nonlinear programming using minimax techniques ", Journal Optim. Theory Appl. 13 ( 1974 ), pp. 607–619

    Google Scholar 

  2. Broyden, Dennis, Moré: " On the local and superlinear convergence of Quasi — Newton — methods ", J.Inst. Math. Appl. 12 ( 1973 ), pp. 223–245

    Google Scholar 

  3. Charalambous, Conn: " An efficient method to solve the minimax problem directly ", SIAM Journal on Numerical Analysis 15 ( 1 ) ( 1978 ) pp. 162–187

    Google Scholar 

  4. Conn: " Constrained optimization using a nondifferentiable penalty function ", SIAM J.Num.Anal. 10 ( 1973 ), pp. 764–784

    Google Scholar 

  5. Dem'yanov, Malozemov: " Introduction to minimax ", John Wiley and sons 1974

    Google Scholar 

  6. Hald, Madsen: " A 2 — stage algorithm for minimax optimization ", Report No NI-78-11, Sept. 1978, Danmarks Tekniske Højskole, Lyngby

    Google Scholar 

  7. Hettich: " Numerical Methods for Nonlinear Chebyshev Approximation ", in: Meinardus, ed., "Approximation in Theorie und Praxis", Bibliographisches Inst., Mannheim, 1979 ( to appear )

    Google Scholar 

  8. Himmelblau: " Applied Nonlinear Programming ", McGraw — Hill, 1972

    Google Scholar 

  9. Hornung: " Algorithmen zur Lösung eines diskreten Minimax Problemes ", Thesis, University of Würzburg, 1979

    Google Scholar 

  10. Kiekebusch — Müller: " Eine Klasse von Verfahren zur Bestimmung von stationären Punkten, insbesondere Sattelpunkten ", Thesis, University of Würzburg, 1976

    Google Scholar 

  11. Lemaréchal: " An extension of Davidon methods to nondifferentiable problems ", Math. Progr. Study 3 ( Nondifferentiable Optimization ) ( 1975 ), pp. 95–109

    Google Scholar 

  12. Lemaréchal, Mifflin: " Nonsmooth optimization ", Proceedings of the IIASA Workshop, March 28–April 8, 1977

    Google Scholar 

  13. Madsen, Schjaer-Jacobsen: " Constrained minimax optimization ", Report No 77-03, 1977, Danmarks Tekniske Højskole, Lyngby

    Google Scholar 

  14. Ortege, Rheinboldt: " Iterative solution of nonlinear equations in several variables ", New York, London: Academic Press 1970

    Google Scholar 

  15. Pankrath: Diploma thesis on algorithms of Dem'yanov, University of Würzburg, 1979 ( to appear )

    Google Scholar 

  16. Reinhardt: " Untersuchung eines Verfahrens zur Minimierung einer nichtdifferenzierbaren exakten Penaltyfunktion " Diploma — thesis University of Würzburg, 1977

    Google Scholar 

  17. Rockafellar: " convex analysis ", Princeton University Press, Princeton, N.Y. 1970

    Google Scholar 

  18. Wolfe: " A method of conjugate subgradients ", Math. Progr. Study 3 ( 1975 ), pp. 190–205

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

K. Iracki K. Malanowski S. Walukiewicz

Rights and permissions

Reprints and permissions

Copyright information

© 1980 Springer-Verlag

About this paper

Cite this paper

Hornung, R. (1980). Algorithms for the solution of a discrete minimax problem: Subgradient methods and a new fast newton — Method. In: Iracki, K., Malanowski, K., Walukiewicz, S. (eds) Optimization Techniques. Lecture Notes in Control and Information Sciences, vol 23. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0006590

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics