Stochastic Smoothing Methods for Nonsmooth Global Optimization
Abstract. The paper presents the results of testing the stochastic smoothing method for global optimization of a multiextremal function in a convex feasible subset of Euclidean space. Preliminarily, the objective function is extended outside the admissible region so that its global minimum does not...
Main Author: | V.I. Norkin |
---|---|
Format: | Article |
Language: | English |
Published: |
V.M. Glushkov Institute of Cybernetics
2020-03-01
|
Series: | Кібернетика та комп'ютерні технології |
Subjects: | |
Online Access: | http://cctech.org.ua/13-vertikalnoe-menyu-en/89-abstract-20-1-1-arte |
Similar Items
-
Short Paper - A note on the Frank–Wolfe algorithm for a class of nonconvex and nonsmooth optimization problems
by: de Oliveira, Welington
Published: (2023-01-01) -
Acceleration in first-order optimization methods: promenading beyond convexity or smoothness, and applications
by: Martinez Rubio, D
Published: (2021) -
Bundle Enrichment Method for Nonsmooth Difference of Convex Programming Problems
by: Manlio Gaudioso, et al.
Published: (2023-08-01) -
Efficiency of subgradient method in solving nonsmooth optimization problems /
by: Nur Azira Abdullah, 1990-, et al.
Published: (2014) -
A one-parameter filled function for nonsmooth global optimization and its application /
by: Zhang, Ying, et al.