Login / Signup

A quasi-Newton proximal bundle method using gradient sampling technique for minimizing nonsmooth convex functions.

Morteza MalekniaMostafa Shamsi
Published in: Optim. Methods Softw. (2022)
Keyphrases
  • convex functions
  • optimization method
  • dynamic programming
  • objective function
  • computational complexity
  • cost function
  • convex optimization