# Convex Analysis

## 1st Edition

Chapman and Hall/CRC

176 pages | 64 B/W Illus.

Paperback: 9781498706377
pub: 2014-10-20
SAVE ~\$17.39
\$86.95
\$69.56
x
Hardback: 9781138441675
pub: 2017-07-27
SAVE ~\$41.00
\$205.00
\$164.00
x
eBook (VitalSource) : 9780429082450
pub: 2014-10-20
from \$41.98

FREE Standard Shipping!

### Description

Convexity is an ancient idea going back to Archimedes. Used sporadically in the mathematical literature over the centuries, today it is a flourishing area of research and a mathematical subject in its own right. Convexity is used in optimization theory, functional analysis, complex analysis, and other parts of mathematics.

Convex Analysis introduces analytic tools for studying convexity and provides analytical applications of the concept. The book includes a general background on classical geometric theory which allows readers to obtain a glimpse of how modern mathematics is developed and how geometric ideas may be studied analytically.

Featuring a user-friendly approach, the book contains copious examples and plenty of figures to illustrate the ideas presented. It also includes an appendix with the technical tools needed to understand certain arguments in the book, a tale of notation, and a thorough glossary to help readers with unfamiliar terms. This book is a definitive introductory text to the concept of convexity in the context of mathematical analysis and a suitable resource for students and faculty alike.

### Reviews

"The goal of this user-friendly and self-contained book is to introduce and study the notion of convexity of sets and functions in Euclidean spaces with a perspective that is closer than usual to the approach and the tools normally prerogatives of the mathematical analysis setting."

Zentralblatt MATH 1310

Why Convexity?

Basic Ideas

Introduction

The Classical Theory

Separation Theorems

Approximation

Functions

Defining Function

Analytic Definition

Convex Functions

Exhaustion Functions

More on Functions

Other Characterizations

Convexity of Finite Order

Extreme Points

Support Functions

Approximation from Below

Bumping

Applications

The Krein-Milman Theorem

The Minkowski Sum

Brunn-Minkowski

More Sophisticated Ideas

The Polar of a Set

Optimization

Introductory Thoughts

Setup for the Simplex Method

Augmented Form

The Simplex Algorithm

Generalizations

Integral Representation

The Gamma Function

Hard Analytic Facts

Sums and Projections

The MiniMax Theorem

Concluding Remarks

Appendix: Technical Tools

Table of Notation

Glossary

Steven G. Krantz received his PhD from Princeton University. Dr. Krantz has taught at UCLA, Princeton University, Penn State, and Washington University in St. Louis. For five years he was the department chair at Washington University. Dr. Krantz has received the Chauvenet Prize, awarded for outstanding mathematical expository writing. He has also been awarded the Kemper Prize and the Beckenbach Book Award. Dr. Krantz is the founding editor of the Journal of Geometric Analysis as well as Complex Analysis and its Synergies. He has written nearly 195 scholarly papers and more than 75 books.