Optimization inequalities cheatsheet

This article is from http://fa.bianp.net/blog/2017/optimization-inequalities-cheatsheet/, just record it.

Most proofs in optimization consist in using inequalities for a particular function class in some creative way. This is a cheatsheet with inequalities that I use most often. It considers class of functions that are convex, strongly convex and L -smooth.
Setting. f is a function RpR . Below are a set of inequalities that are verified when f belongs to a particular class of functions and x,yRp are arbitrary elements in its domain.
f is L -smooth. This is the class of functions that are differentiable and its gradient is Lipschitz continuous.

  1. f(y)f(x)xy
  2. |f(x)f(y)f(x),yx|L2yx2
  3. 2f(x)L (assuming f is twice differentiable)

f is convex.

  1. f(x)f(y)+f(x),xy
  2. 0f(x)f(y),xy
  3. f(EX)E[f(X)] where X is a random variable (Jensen’s inequality).

f is both L -smooth and convex:

  1. 1Lf(x)f(y)2f(x)f(y),xy
  2. 0f(y)f(x)f(x),yxL2xy2
  3. f(x)f(y)+f(x),xy12Lf(x)f(y)2

f is μ -strongly convex. Set of functions f such that fμ22 is convex. It includes the set of convex functions with μ=0 .

  1. f(x)f(y)+f(x),xyμ2xy2
  2. μ2xy2f(x)f(y),xy
  3. μ2xx2f(x)f(x)

f is both L -smooth and μ -strongly convex.

μLμ+Lxy2+1μ+Lf(x)f(y)2f(x)f(y),xy

Most of these inequalities appear in the Book: “Introductory lectures on convex optimization: A basic course” by Nesterov, Yurii (2013, Springer Science & Business Media). Another good source (and freely available for download) is the book “Convex Optimization” by
Stephen Boyd and Lieven Vandenberghe.

猜你喜欢

转载自blog.csdn.net/chunyun0716/article/details/54582033