Login / Signup

A new method based on the proximal bundle idea and gradient sampling technique for minimizing nonsmooth convex functions.

Morteza MalekniaMostafa Shamsi
Published in: Comput. Optim. Appl. (2020)
Keyphrases
  • convex functions
  • objective function
  • computational complexity
  • dynamic programming
  • upper bound
  • linear programming
  • training samples