I am working on the development of novel optimization algorithm where it DOES NOT suffer from the non-differentiability (cf. subgradient), which also works well in differentiable class of the objectives.
Now, I want to explore the behaviour of my algorithm. I only took relavant optimization courses like 4 lectures, but it does not necessarily mean I am super good or much experienced in this field.
So, is there any good article which $\mathbf{LISTS}$ interesting known convex objectives at a single sight for this purpose? Or should I manually try this and that based on my own experience so far?