What is convex planning?

 

 

Optimization Problem (p) min f (x). When D is a convex set and f (x) is a convex function, this planning is called a convex planning.

 

 

What is a convex set: if any two points in a vertex set belong to D, D is a convex set:

 

A convex set is a single point or an uninterrupted line (including a straight line, a ray, or a line segment). A Convex Set in a three-dimensional space is an intuitive convex image. (For example, there are fan surfaces, circles, and ovans in two dimensions, and Solid Sphere in three dimensions. In most cases, the intersection of two convex sets is also a convex set, and the empty set is also a convex set)

 

 

What is convex function:

For unary functions:

 

For binary functions:

 

 

 

 

Example:

 

What is convex planning?