A new method based on the proximal bundle idea and gradient sampling technique for minimizing nonsmooth convex functions. - Morteza Maleknia; Mostafa Shamsi (Comput. Optim. Appl., 2020)

A Gradient Sampling Method Based on Ideal Direction for Solving Nonsmooth Optimization Problems. - Morteza Maleknia; Mostafa Shamsi (J. Optim. Theory Appl., 2020)

A quasi-Newton proximal bundle method using gradient sampling technique for minimizing nonsmooth convex functions. - Morteza Maleknia; Mostafa Shamsi (Optim. Methods Softw., 2022)

An effective subgradient algorithm via Mifflin's line search for nonsmooth nonconvex multiobjective optimization. - Morteza Maleknia; Majid Soleimani-Damaneh (Eur. J. Oper. Res., 2024)