O'Reilly logo

Convex Optimization by Lieven Vandenberghe, Stephen Boyd

Stay ahead with the world's most comprehensive technology and business learning platform.

With Safari, you learn the way you learn best. Get unlimited access to videos, live online training, learning paths, books, tutorials, and more.

Start Free Trial

No credit card required

Chapter 3

Convex functions

3.1  Basic properties and examples

3.1.1  Definition

A function f : Rn R is convex if dom f is a convex set and if for all x, y dom f, and θ with 0θ1, we have

(3.1)

Geometrically, this inequality means that the line segment between (x, f(x)) and (y, f(y)), which is the chord from x to y, lies above the graph of f (figure 3.1). A function f is strictly convex if strict inequality holds in (3.1) whenever x y and 0 θ 1. We say f is concave if f is convex, and strictly concave if f is strictly convex. ...

With Safari, you learn the way you learn best. Get unlimited access to videos, live online training, learning paths, books, interactive tutorials, and more.

Start Free Trial

No credit card required