Home › Applied › Undergraduate Convexity
  • Undergraduate Convexity by Lauritzen Niels book cover
  • Undergraduate Convexity by Lauritzen Niels book cover
1 2

Undergraduate Convexity

by Lauritzen Niels

Be the first to review this book

Convexity through computation and examples

$51.22 USD
$56.92 USD $51.22 USD
Save 10%

Paperback New English

Delivery to your door
In stock·Dispatches in 1–2 business days
Standard shipping* from $4.35
Standard shipping transit* 5–8 business days after dispatch

Faster options are available.

Rates and delivery estimates depend on your destination and item quantity. Estimates are informational only; the final shipping method and rate are selected at checkout.
Secure checkout
American Express Apple Pay DiscoverGoogle Pay Mastercard PayPalVisa
30-day eligible returns Returns & refunds policy

AlbakiReads Editorial

Convexity through computation and examples

Designed as an elementary introduction grounded in undergraduate teaching for computer science, economics, and mathematics students, the book builds its account of convexity from concrete methods. It begins with linear inequalities and Fourier–Motzkin elimination, then develops polyhedra, the double description method, and the simplex algorithm. Later chapters move to closed convex sets and convex functions of one and several variables, before turning to convex optimization. The closing material covers Karush–Kuhn–Tucker conditions, duality, and an interior point algorithm, giving the subject a route from foundational constructions to optimization techniques.

Good fit for readers who enjoy

  • Undergraduates in computer science, economics, or mathematics seeking an elementary introduction to convexity.
  • Readers interested in computational methods and worked examples in convex sets, functions, and optimization.

Themes

Convex sets and functionsLinear inequalities and polyhedraConvex optimizationComputational methods

Based on publisher information and book metadata.

Book overview

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. Study Guide here
Shipping & returnsShipping options, delivery timing, and our return policy.

In-stock items normally dispatch within 1–2 business days. The ZIP-code estimator on this page is informational only; the final shipping method, price, and availability are confirmed at checkout for your full order.

For the initial delivery estimate we use these transit windows after dispatch: Standard 5–8 business days, Expedited 2–4 business days, and Priority 1–2 business days. Holiday delays are not included.

Eligible items can be returned within 30 days in accordance with our return policy.

Customer reviews

You may also like

View all