AI Search
Undergraduate convexity : from Fourier and Motzkin to Kuhn and Tucker.
Material type:
TextPublication details: Singapore ; Hackensack, NJ : World Scientific, 2013.Description: 283 p. : illISBN: - 9789814412513
- 9814412511
- 9789814452762
- 9814452769
- QA331.5 L295 U 2013
English Books
| Cover image | Item type | Current library | Home library | Collection | Shelving location | Call number | Materials specified | Vol info | URL | Copy number | Status | Notes | Date due | Barcode | Item holds | Item hold queue priority | Course reserves | |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
|
English Books
|
MATRIX Library General Eng/FL.3 | General Books | QA331.5 .L295 U 2013 (Browse shelf(Opens below)) | C.1 | Available | 1000385383 |
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.
HKBU library
YT2025 M08
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.
There are no comments on this title.