Login / Signup

A method to refine the discrete Jensen's inequality for convex and mid-convex functions.

László Horváth
Published in: Math. Comput. Model. (2011)
Keyphrases
  • convex functions
  • objective function
  • dynamic programming
  • probabilistic model
  • upper bound
  • convex optimization
  • inequality constraints