It examines duality theory for convex optimization problems. The chapter also presents common examples of convex functions, and helps the students to formulate and solve a dual problem.

The goal of this cookbook is to serve as a reference for various convex optimization problems (with a bias toward computer graphics and geometry processing). Unless ...

The method uses linear programming to construct continuous piecewise affine and convex Lyapunov functions for the switched system. We demonstrate the applicability of our method with two examples from ...

Mathematically, a convex function is one for which the line connecting any two points on the graph of the function lies on or above the graph (see Figure 1). For example, suppose that a trader can ...