Undergraduate convexity from Fourier and Motzkin to Kuhn and Tucker.

Author/creator Lauritzen, Niels, 1964-
Format Electronic
Publication InfoSingapore ; Hackensack, NJ : World Scientific,
Descriptionxiv, 283 p. : ill. ; 23 cm.
Supplemental ContentFull text available from Ebook Central - Academic Complete
Subjects

Contents 1. Fourier-Motzkin elimination -- 2. Affine subspaces -- 3. Convex subsets -- 4. Polyhedra -- 5. Computations with polyhedra -- 6. Closed convex subsets and separating hyperplanes -- 7. Convex functions -- 8. Differentiable functions of several variables -- 9. Convex functions of several variables -- 10. Convex optimization -- Appendices.
Summary Based on undergraduate teaching to students in computer science, economics and mathematics at Aarhus University, this is an elementary introduction to convex sets and convex functions with emphasis on concrete computations and examples. Starting from linear inequalities and Fourier-Motzkin elimination, the theory is developed by introducing polyhedra, the double description method and the simplex algorithm, closed convex subsets, convex functions of one and several variables ending with a chapter on convex optimization with the Karush-Kuhn-Tucker conditions, duality and an interior point algorithm -- P. [4] of cover.
Bibliography noteIncludes bibliographical references (p. 273-275) and index.
Access restrictionAvailable only to authorized users.
Other formsAlso available in electronic format via the World Wide Web.
Technical detailsMode of access: World Wide Web
Genre/formElectronic books.
LCCN 2013427381
ISBN9789814412513 (hbk.)
ISBN9814412511 (hbk.)
ISBN9789814452762 (pbk.)
ISBN9814452769 (pbk.)

Availability

Library Location Call Number Status Item Actions
Electronic Resources Access Content Online ✔ Available