Free Delivery Over $100
|
|
|||
|
||||
OverviewBased 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.Contents: Fourier–Motzkin Elimination Affine SubspacesConvex SubsetsPolyhedraComputations with PolyhedraClosed Convex Subsets and Separating HyperplanesConvex FunctionsDifferentiable Functions of Several VariablesConvex Functions of Several VariablesConvex Optimization Appendices: AnalysisLinear (In)dependence and the Rank of a MatrixReadership: Undergraduates focusing on convexity and optimization. Full Product DetailsAuthor: Niels Lauritzen (Aarhus Universitet, Denmark)Publisher: World Scientific Publishing Company Imprint: World Scientific Publishing Company ISBN: 9781299556331ISBN 10: 1299556337 Pages: 298 Publication Date: 01 January 2013 Audience: General/trade , General Format: Electronic book text Publisher's Status: Active Availability: In stock  We have confirmation that this item is in stock with the supplier. It will be ordered in for you and dispatched immediately. Table of ContentsReviewsAuthor InformationTab Content 6Author Website:Countries AvailableAll regions |
||||
