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

    • 0f(x)f(y),xy
    • 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
  4. 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.

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值