معرفی الگوریتم تقریبی دسته‌ای برای حل عددی مسائل بهینه‌سازی ناهموار

[1] A. Bagirov, N. Karmitsa and M. M. Mäkelä, Introduction to nonsmooth optimization Theory, practice and software, Springer,
Cham, 2014.
[2] J. Burke, A. Lewis and M. Overton, A robust gradient sampling algorithm for nonsmooth, nonconvex optimization, SIAM J. Optim.,
15 (2005) 571–779.
[3] F. H. Clarke, Y. S. Ledyaev, R. J. Stern and P. R. Wolenski, Nonsmooth analysis and control theory, Graduate Texts in Mathematics,
178, Springer-Verlag, New York, 1998.
[4] W. Hare and C. Sagastizábal, A redistributed proximal bundle method for nonconvex optimization, SIAM J. Optim., 20 (2010)
2442–2473.
[5] N. Hoseini and S. Nobakhtian, A new trust region method for nonsmooth nonconvex optimization, Optimization, 67 (2018) 1265–
1286.
[6] N. Hoseini Monjezi and S. Nobakhtian, A new infeasible proximal bundle algorithm for nonsmooth nonconvex constrained opti-mization, Comput. Optim. Appl., 74 (2019) 443–480.
[7] C. Lemaréchal, Bundle methods in nonsmooth optimization, Nonsmooth optimization (Proc. IIASA Workshop, Laxenburg, 1977),
IIASA Proc. Ser., 3, Pergamon, Oxford-Elmsford, N. Y., (1978) 79–102.
[8] M. M. Mäkelä and P. Neittaanmäki, Nonsmooth Optimization: Analysis and Algorithms with Applications to Optimal Control,
World Scientific, Singapore, 1992.
[9] J. Nocedal and S. J. Wright, Numerical Optimization, 2nd ed., Springer, New York, 2006.