This user-friendly text offers a thorough introduction to the part of optimization theory that lies between approximation theory and mathematical programming, both linear and nonlinear. Written by two distinguished mathematicians, the expert treatment covers the essentials, incorporating important background materials, examples, and extensive notes.
Geared toward advanced undergraduate and graduate students of mathematical programming, the text explores best approximation by algebraic polynomials in both discrete and continuous cases; the discrete problem, with and without constraints; the generalized problem of nonlinear programming; and the continuous minimax problem. Several appendixes discuss algebraic interpolation, convex sets and functions, and other topics. 1974 edition.
Geared toward advanced undergraduate and graduate students of mathematical programming, the text explores best approximation by algebraic polynomials in both discrete and continuous cases; the discrete problem, with and without constraints; the generalized problem of nonlinear programming; and the continuous minimax problem. Several appendixes discuss algebraic interpolation, convex sets and functions, and other topics. 1974 edition.
Zahle einfach mit Karte, Klarna, Apple Pay oder Google Pay. Nicht zufrieden? Du hast immer ein 14-tägiges Widerrufsrecht. Lies mehr in unseren AGB. Hast du Fragen, schreib uns eine E-Mail an hello@memmo.org.
Memmo macht das Lernen einfacher – wo auch immer du bist. Bei uns findest du deine Kursbücher und smarte Lerntools an einem Ort: Zusammenfassungen, Quizzes, Podcasts und Lernkarten. Und Ted, dein Lernbuddy, beantwortet alles, was du wissen möchtest. Über 50.000 Studierende lernen bereits hier – gemacht, damit du schneller lernst und weniger Stress hast.
Das könnte dir auch gefallen
Buch kaufen0