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...
मुख्य लेखक: | V.I. Norkin |
---|---|
स्वरूप: | लेख |
भाषा: | English |
प्रकाशित: |
V.M. Glushkov Institute of Cybernetics
2020-03-01
|
श्रृंखला: | Кібернетика та комп'ютерні технології |
विषय: | |
ऑनलाइन पहुंच: | http://cctech.org.ua/13-vertikalnoe-menyu-en/89-abstract-20-1-1-arte |
समान संसाधन
-
Acceleration in first-order optimization methods: promenading beyond convexity or smoothness, and applications
द्वारा: Martinez Rubio, D
प्रकाशित: (2021) -
Short Paper - A note on the Frank–Wolfe algorithm for a class of nonconvex and nonsmooth optimization problems
द्वारा: de Oliveira, Welington
प्रकाशित: (2023-01-01) -
Bundle Enrichment Method for Nonsmooth Difference of Convex Programming Problems
द्वारा: Manlio Gaudioso, और अन्य
प्रकाशित: (2023-08-01) -
Efficiency of subgradient method in solving nonsmooth optimization problems /
द्वारा: Nur Azira Abdullah, 1990-, और अन्य
प्रकाशित: (2014) -
A one-parameter filled function for nonsmooth global optimization and its application /
द्वारा: Zhang, Ying, और अन्य