B1 Non-refereed article in a scientific journal
Special Issue "Nonsmooth Optimization in Honor of the 60th Birthday of Adil M. Bagirov": Foreword by Guest Editors
Authors: Napsu Karmitsa, Sona Taheri
Publisher: MDPI
Publication year: 2020
Journal: Algorithms
Journal name in source: ALGORITHMS
Journal acronym: ALGORITHMS
Article number: ARTN 282
Volume: 13
Issue: 11
Number of pages: 4
eISSN: 1999-4893
DOI: https://doi.org/10.3390/a13110282
Self-archived copy’s web address: https://research.utu.fi/converis/portal/detail/Publication/51352597
Abstract
Nonsmooth optimization refers to the general problem of minimizing (or maximizing) functions that have discontinuous gradients. This Special Issue contains six research articles that collect together the most recent techniques and applications in the area of nonsmooth optimization. These include novel techniques utilizing some decomposable structures in nonsmooth problems-for instance, the difference-of-convex (DC) structure-and interesting important practical problems, like multiple instance learning, hydrothermal unit-commitment problem, and scheduling the disposal of nuclear waste.
Nonsmooth optimization refers to the general problem of minimizing (or maximizing) functions that have discontinuous gradients. This Special Issue contains six research articles that collect together the most recent techniques and applications in the area of nonsmooth optimization. These include novel techniques utilizing some decomposable structures in nonsmooth problems-for instance, the difference-of-convex (DC) structure-and interesting important practical problems, like multiple instance learning, hydrothermal unit-commitment problem, and scheduling the disposal of nuclear waste.
Downloadable publication This is an electronic reprint of the original article. |  |
UTU Research Portal