Skip to main content
SpringerLink
Log in

Optimierung

  • Chapter
Stoer/Bulirsch: Numerische Mathematik 1

Part of the book series: Springer-Lehrbuch ((SLB))

  • 10k Accesses

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 29.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 37.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.

Literatur zu Kapitel 6

  • Baptist, P., Stoer, J. (1977): On the relation between quadratic termination and convergence properties of minimization algorithms. Part II. Applications. Numer. Math. 28, 367–391.

    Article  MATH  MathSciNet  Google Scholar 

  • Bartels, R.H. (1971): A stabilization of the simplex method. Numer. Math. 16 414–434.

    Article  MATH  MathSciNet  Google Scholar 

  • Bertsekas, D.P. (1999): Nonlinear Programming, 2nd Edition. Belmont, MA: Athena Scientific.

    MATH  Google Scholar 

  • Bixby, R.E. (1992): Implementing the simplex method: The initial basis. ORSA J. Comput. 4 267–284.

    MATH  MathSciNet  Google Scholar 

  • Bixby, R.E. (2002): Solving real-world linear programs: A decade and more of progress. Oper. Res. 50 (2002), 3–15.

    Article  MATH  MathSciNet  Google Scholar 

  • Borgwardt, K.H. (2001): Optimierung, Operations Research, Spieltheorie. Basel: Birkhäuser.

    MATH  Google Scholar 

  • Broyden, C.G. (1965): A class of methods for solving nonlinear simultaneous equations. Math. Comput. 19, 577–593.

    Article  MATH  MathSciNet  Google Scholar 

  • Broyden, C.G. (1967): Quasi-Newton-methods and their application to function minimization. Math. Comput. 21, 368–381.

    Article  MATH  MathSciNet  Google Scholar 

  • Broyden, C.G. (1970): The convergence of a class of double rank minimization algorithms. 1. General considerations, 2. The new algorithm. J. Inst. Math. Appl. 6, 76–90, 222–231.

    Article  MATH  MathSciNet  Google Scholar 

  • Broyden, C.G., Dennis, J.E., Moré, J.J. (1970): On the local and superlinear convergence of quasi-Newton methods. J. Inst. Math. Appl. 12, 223–245.

    Article  Google Scholar 

  • Collatz, L., Wetterling, W. (1971): Optimierungsaufgaben. Berlin-Heidelberg: Springer.

    MATH  Google Scholar 

  • Conn, A.R., Gould, N.I.M., Toint, P.L. (2000): Trust-Region Methods. Philadelphia: SIAM.

    MATH  Google Scholar 

  • Dantzig, G.B. (1966): Lineare Programmierung und Erweiterungen. Berlin-Heidelberg: Springer.

    MATH  Google Scholar 

  • Davidon, W.C. (1959): Variable metric methods for minimization. Argonne National Laboratory Report ANL-5990.

    Google Scholar 

  • Davidon, W.C. (1975): Optimally conditioned optimization algorithms without line searches. Math. Programming 9, 1–30.

    Article  MATH  MathSciNet  Google Scholar 

  • Dennis, J.E., Jr., Schnabel, R.B. (1996): Numerical Methods for Unconstrained Optimization and Nonlinear Equations. Philadelphia: SIAM.

    MATH  Google Scholar 

  • Dixon, L.C.W. (1971): The choice of step length, a crucial factor in the performance of variable metric algorithms. In: Numerical Methods for Nonlinear Optimization, F.A. Lootsma, Ed., 149–170. New York: Academic Press.

    Google Scholar 

  • Fletcher, R. (2000): Practical Methods of Optimization, 2nd Edition. New York: Wiley.

    Google Scholar 

  • Fletcher, R., Powell, M.J.D. (1963): A rapidly convergent descent method for minimization. Comput. J. 6, 163–168.

    MATH  MathSciNet  Google Scholar 

  • Gass, S.T. (2003): Linear Programming, 5th Edition. Mineola, NY: Dover.

    Google Scholar 

  • Himmelblau, D.M. (1972): Applied Nonlinear Programming. New York: McGraw-Hill.

    MATH  Google Scholar 

  • Jarre, F., Stoer, J. (2003): Optimierung. Berlin-Heidelberg: Springer.

    Google Scholar 

  • Karmarkar, N.K. (1984): A new polynomial-time algorithm for linear programming. Combinatorica 4 373–395.

    Article  MATH  MathSciNet  Google Scholar 

  • Luenberger, D.G. (1984): Introduction to Linear and Nonlinear Programming, 2nd Edition. Reading, MA: Addison-Wesley.

    Google Scholar 

  • Matoušek, J., Gärtner, B. (2006): Understanding and Using Linear Programming. Berlin-Heidelberg-New York: Springer.

    Google Scholar 

  • Moré, J.J., Wright, S.J. (1993): Optimization Software Guide. Philadelphia: SIAM.

    MATH  Google Scholar 

  • Murty, K.G. (1976): Linear and Combinatorial Programming. New York: Wiley.

    MATH  Google Scholar 

  • Nash, S.G., Sofer, A. (1996): Linear and Nonlinear Programming. New York: McGraw-Hill.

    Google Scholar 

  • Nocedal, J., Wright, S.J. (1999): Numerical Optimization. Berlin-Heidelberg-New York: Springer.

    MATH  Google Scholar 

  • Oren, S.S., Luenberger, D.G. (1974): Self-scaling variable metric (SSVM) algorithms. I. Criteria and sufficient conditions for scaling a class of algorithms. Manage. Sci. 20, 845–862.

    Article  MATH  MathSciNet  Google Scholar 

  • Oren, S.S., Spedicato, E. (1976): Optimal conditioning of self-scaling variable metric algortihms. Math. Programming 10, 70–90.

    Article  MATH  MathSciNet  Google Scholar 

  • Potra, F.A., Wright, S.J. (2000): Interior-point methods. J. Comput. Appl. Math. 124, 281–302.

    Article  MATH  MathSciNet  Google Scholar 

  • Powell, M.J.D. (1975): Some global convergence properties of a variable metric algorithm for minimization without exact line searches. In: Proc. AMS Symposium on Nonlinear Programming 1975. Providence, RI: American Mathematical Society.

    Google Scholar 

  • Roos, C., Terlaky, T., Vial, J.-P. (2005): Interior Point Methods for Linear Optimization, 2nd Edition. Berlin-Heidelberg-New York: Springer.

    Google Scholar 

  • Spellucci, P. (1993): Numerische Verfahren der nichtlinearen Optimierung. Basel: Birkhäuser.

    MATH  Google Scholar 

  • Schrijver, A. (1998): Theory of Linear and Integer Programming, Paperback Edition. New York: Wiley.

    MATH  Google Scholar 

  • Stoer, J. (1975): On the convergence rate of imperfect minimization algorithms in Broyden’s β-class. Math. Programming 9, 313–335.

    Article  MATH  MathSciNet  Google Scholar 

  • Stoer, J. (1977): On the relation between quadratic termination and convergence properties of minimization algorithms. Part I. Theory. Numer. Math. 28, 343–366.

    Article  MATH  MathSciNet  Google Scholar 

  • Vanderbei, R.J. (2001): Linear Programming: Foundations and Extensions, 2nd Edition. Boston: Kluwer Academic Publishers.

    MATH  Google Scholar 

  • Wright, S.J. (1997): Primal-Dual Interior-Point Methods. Philadelphia: SIAM.

    MATH  Google Scholar 

Download references

Rights and permissions

Reprints and permissions

Copyright information

© 2007 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

(2007). Optimierung. In: Stoer/Bulirsch: Numerische Mathematik 1. Springer-Lehrbuch. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-45390-1_6

Download citation

Publish with us

Policies and ethics

Search

Navigation