Ali Hakan Tor

Comparative assessment of smooth and non-smooth optimization solvers in HANSO software

The aim of this study is to compare the performance of smooth and nonsmooth optimization solvers from HANSO (Hybrid Algorithm for Nonsmooth Opti- mization) software. The smooth optimization solver is the implementation of the Broyden-Fletcher-Goldfarb-Shanno (BFGS) method and the nonsmooth optimization solver is the Hybrid Algorithm for Nonsmooth Optimization. More precisely, the nonsmooth optimization algorithm is the combination of the BFGS and the Gradient Sampling Algorithm (GSA). We use well-known collection of academic test problems for nonsmooth optimization containing both convex and nonconvex problems. The motivation for this research is the importance of the comparative assessment of smooth optimization methods for solving nonsmooth optimization problems. This assessment will demonstrate how successful is the BFGS method for solving nonsmooth optimization prob- lems in comparison with the nonsmooth optimization solver from HANSO. Performance profiles using the number iterations, the number of function eval- uations and the number of subgradient evaluations are used to compare solvers.

PDF

___

[1] Outrata, J., Kocvara, M., & Zowe, J. (2013). Nonsmooth approach to optimization prob- lems with equilibrium constraints: theory, ap- plications and numerical results (Vol. 28). Springer Science & Business Media.
[2] ̈Ozmen, A. & Weber, G-W. (2012). Robust conic generalized partial linear models using rcmars method-a robustification of cgplm. In AIP Conference Proceedings, vol.1499, 337– 343.
[3] ̈Ozmen, A., Weber, G-W., Batmaz, ̇I. & Kropat, E. (2011). Rcmars: Robustification of cmars with different scenarios under poly- hedral uncertainty set. Communications in Nonlinear Science and Numerical Simulation, 16(12), 4780–4787.
[4] Mistakidis, E.S. & Stavroulakis, G.E. (2013). Nonconvex optimization in mechanics: algo- rithms, heuristics and engineering applica- tions by the FEM, volume 21. Springer Sci- ence & Business Media.
[5] Weber, G-W., Alparslan-G ̈ok, Z.S. & ̈Oyler, B.S. (2009). A new mathematical approach in environmental and life sciences: gene– environment networks and their dynam- ics. Environmental Modeling & Assessment, 14(2), 267–288.
[6] Weber, G-W., Tezel, A., Taylan, P., Soyler, A. & C ̧ etin, M. (2008). Mathematical con- tributions to dynamics and optimization of gene-environment networks. Optimization, 57(2), 353–377.
[7] Bagirov, A.M., Karmitsa, N., & Taheri, S. (2020). Partitional Clustering via Nonsmooth Optimization: Clustering via Optimization. Springer Nature.
[8] Demyanov, V.F., Bagirov, A.M. & Rubinov, A.M. (2002). A method of truncated codiffer- ential with application to some problems of cluster analysis. Journal of Global Optimiza- tion, 23(1), 63–80.
[9] Clarke, F.H., Ledyaev, Y.S., Stern, R.J. & Wolenski, P.R. (2008). Nonsmooth analysis and control theory, volume 178. Springer Sci- ence & Business Media.
[10] Bagirov, A.M., Karmitsa, N. & M ̈akel ̈a, M.M. (2014). Introduction to Nonsmooth Op- timization. Theory, Practice and Software. Springer, Cham.
[11] Overton, M.L. Hanso: Hybrid algo- rithm for non-smooth optimization. https://cs.nyu.edu/faculty/overton/ software/hanso/index.html. Accessed: 2020-08-15.
[12] Lewis, A.S. & Overton, M.L. (2013). Non- smooth optimization via quasi-newton meth- ods. Mathematical Programming, 141(1-2), 135–163.
[13] Ermoliev, Y.M. (1982). Methods of nondiffer- entiable and stochastic optimization and their applications. In Progress in nondifferentiable optimization, volume 8 of IIASA Collabora- tive Proc. Ser. CP-82, pages 5–27. Interna- tional Institute for Applied Systems Analysis, Laxenburg.
[14] Shor, N.Z. (1985). Minimization methods for nondifferentiable functions, volume 3 of Springer Series in Computational Mathe- matics. Springer-Verlag, Berlin. Translated from the Russian by K. C. Kiwiel and A. Ruszczy ́nski.
[15] Burke, J.V., Lewis, A.S. & Overton, M.L. (2002). Approximating subdifferentials by random sampling of gradients. Mathematics of Operations Research, 27(3), 567–584.
[16] Burke, J.V., Lewis, A.S. & Overton, M.L. (2005). A robust gradient sampling algo- rithm for nonsmooth, nonconvex optimiza- tion. SIAM Journal on Optimization, 15(3), 751–779.
[17] Burke, J.V., Henrion, D., Lewis, A.S. & Overton, M.L. (2006). Stabilization via non- smooth, nonconvex optimization. Institute of Electrical and Electronics Engineers. Trans- actions on Automatic Control, 51(11), 1760– 1769.
[18] Burke, J.V., Lewis, A.S. & Overton, M.L. (2004). Pseudospectral components and the distance to uncontrollability. SIAM Journal on Matrix Analysis and Applications, 26(2), 350–361 (electronic).
[19] Kiwiel, K.C. (2007). Convergence of the gra- dient sampling algorithm for nonsmooth non- convex optimization. SIAM Journal on Opti- mization, 18(2), 379.
[20] Dolan, E.D. & Mor ́e, J.J. (2002). Bench- marking optimization software with perfor- mance profiles. Mathematical Programming. A Publication of the Mathematical Program- ming Society, 91(2, Ser. A), 201–213