Numerical Nonsmooth Optimization

Solving nonsmooth optimization (NSO) problems is critical in many practical applications and real-world modeling systems. The aim of this book is to survey various numerical methods for solving NSO problems and to provide an overview of the latest developments in the field. Experts from around the world share their perspectives on specific aspects of numerical NSO. 

The book is divided into four parts, the first of which considers general methods including subgradient, bundle and gradient sampling methods. In turn, the second focuses on methods that exploit the problem’s special structure, e.g. algorithms for nonsmooth DC programming, VU decomposition techniques, and algorithms for minimax and piecewise differentiable problems. The third part considers methods for special problems like multiobjective and mixed integer NSO, and problems involving inexact data, while the last part highlights the latest advancements in derivative-free NSO.

Given its scope, the book is ideal for students attending courses on numerical nonsmooth optimization, for lecturers who teach optimization courses, and for practitioners who apply nonsmooth optimization methods in engineering, artificial intelligence, machine learning, and business. Furthermore, it can serve as a reference text for experts dealing with nonsmooth optimization.

Adil M. Bagirov received a master degree in Applied Mathematics from Baku State University, Azerbaijan in 1983, and the Candidate of Sciences degree in Mathematical Cybernetics from the Institute of Cybernetics of Azerbaijan National Academy of Sciences in 1989 and PhD degree in Optimization from Federation University Australia (formerly the University of Ballarat), Ballarat, Australia in 2002. He worked at the Space Research Institute (Baku, Azerbaijan), Baku State University (Baku, Azerbaijan), Joint Institute for Nuclear Research (Moscow, Russia). Dr. Bagirov is with Federation University Australia (Ballarat, Australia) since 1999. He currently holds the Associate Professor position at this university. He has won five Australian Research Council Discovery and Linkage grants to conduct research in nonsmooth and global optimization and their applications. He was awarded Australian Research Council Postdoctoral Fellow and Australian Research Council Research Fellow. His main research interests are in the area of nonsmooth and global optimization and their applications in data mining, regression analysis and water management. Dr. Bagirov has published two books on nonsmooth optimization and its applications and more than 150 journal papers, book chapters and papers in conference proceedings.

Manlio Gaudioso got his  “Laurea” degree in Electrical Engineering from Università di Napoli in 1973. Since 1994 he is full professor  of Operations Research at Università della Calabria. His research interests include nonsmooth optimization, integer programming, graph optimization, logistic chain optimization and classification methods in machine learning. He is currently Associate Editor of the journal “Optimization” and of “Vestnik of Saint Petersburg University”.  He plays drums in the Italian Jazz Band “Ars Brevis”.

Napsu Karmitsa (nee Haarala) received her Ph.D. degree from the University of Jyväskylä, Finland, in 2004. At the moment, she holds a position of the Academy Research Fellow granted by the Academy of Finland. In addition, she is an Adjunct Professor in applied mathematics at the University of Turku, Finland. Karmitsa’s research is focused on nonsmooth optimization and analysis. Special emphasis is given to nonconvex, global and large-scale cases, and applications in data mining and machine learning. Her previous book "Introduction to Nonsmooth Optimization: Theory, Practice and Software" (Springer 2014), coauthored with Profs. Adil Bagirov and Marko M. Mäkelä, is the first easy-to-read book on nonsmooth optimization and it is currently a widely used textbook in the area of nonsmooth analysis and optimization. In addition, her forthcoming book "Partitional Clustering via Nonsmooth Optimization: Cluster Analysis via Optimization" (Springer, 2019) coauthored with Prof. Adil Bagirov and PhD. Sona Taheri considers applying nonsmooth optimization in an important practical field of data mining.

Marko M. Mäkelä currently holds the full professorship in Applied Mathematics at the University Turku, Finland. He is also a vice head of the Department of Mathematics and Statistics at the University of Turku. He obtained his MSc degree in Applied Mathematics in 1986 and PhD degree in Scientific Computing in 1990 both from the University of Jyväskylä, Finland. He still holds a Adjunct Professor position at the University of Jyväskylä. Prof. Mäkeläs’ research is focused mainly on nonsmooth analysis and optimization. Special emphasis has been on nonsmooth and nonconvex analysis including optimality conditions and the theory of generalized convexities, together with designing numerical methods for nonsmooth nonconvex optimization. In addition, his research interests include mixed-integer nonlinear programming, multiobjective optimization, metaheuristics in global optimization and industrial applications. He has published two textbooks on nonsmooth optimization and more than one hundred scientific articles. He is currently a Handling Editor of the Journal of Nonsmooth Analysis and Optimization. He plays the clarinet in a wind orchestra and in a dixieband.

Sona Taheri is a Research Fellow at Federation University Australia. Dr Taheri has been at this University since 2009. She has received her PhD degree in Mathematics at this university (formerly the University of Ballarat) in 2012. Underpinning this is her Master degree in Applied Mathematics and Bachelor of Science in Pure Mathematics through University of Tabriz Iran completed in 2004 and 2001, respectively. Dr Taheri’s main research interests include nonconvex and nonsmooth optimization, and their applications in data mining. She is one of the authors (together with Profs. Adil Bagirov and Napsu Karmitsa) of the forthcoming book "Partitional Clustering via Nonsmooth Optimization:Cluster Analysis via Optimization" (Springer, 2019).