<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Publishing DTD v1.3 20210610//EN" "JATS-journalpublishing1-3.dtd">
<article article-type="research-article" dtd-version="1.3" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xml:lang="ru"><front><journal-meta><journal-id journal-id-type="publisher-id">mireabulletin</journal-id><journal-title-group><journal-title xml:lang="ru">Russian Technological Journal</journal-title><trans-title-group xml:lang="en"><trans-title>Russian Technological Journal</trans-title></trans-title-group></journal-title-group><issn pub-type="ppub">2782-3210</issn><issn pub-type="epub">2500-316X</issn><publisher><publisher-name>RTU MIREA</publisher-name></publisher></journal-meta><article-meta><article-id pub-id-type="doi">10.32362/2500-316X-2025-13-2-121-131</article-id><article-id custom-type="edn" pub-id-type="custom">EWCRYQ</article-id><article-id custom-type="elpub" pub-id-type="custom">mireabulletin-1131</article-id><article-categories><subj-group subj-group-type="heading"><subject>Research Article</subject></subj-group><subj-group subj-group-type="section-heading" xml:lang="ru"><subject>МАТЕМАТИЧЕСКОЕ МОДЕЛИРОВАНИЕ</subject></subj-group><subj-group subj-group-type="section-heading" xml:lang="en"><subject>MATHEMATICAL MODELING</subject></subj-group></article-categories><title-group><article-title>Метод оценки выпуклости рельефа целевых функций в процессе поиска экстремума</article-title><trans-title-group xml:lang="en"><trans-title>Method for estimating objective function landscape convexity during extremum search</trans-title></trans-title-group></title-group><contrib-group><contrib contrib-type="author" corresp="yes"><contrib-id contrib-id-type="orcid">https://orcid.org/0000-0002-2696-8592</contrib-id><name-alternatives><name name-style="eastern" xml:lang="ru"><surname>Смирнов</surname><given-names>А. В.</given-names></name><name name-style="western" xml:lang="en"><surname>Smirnov</surname><given-names>Alexande V.</given-names></name></name-alternatives><bio xml:lang="ru"><p>Смирнов Александр Витальевич, к.т.н., доцент, профессор кафедры телекоммуникаций, Институт радиоэлектроники и информатики</p><p>119454, Москва, пр-т Вернадского, д. 78</p><p>Scopus Author ID 56380930700</p></bio><bio xml:lang="en"><p>Alexander V. Smirnov, Cand. Sci. (Eng.), Professor, Department of Telecommunications, Institute of Radio Electronics and Informatics</p><p>78, Vernadskogo pr., Moscow, 119454</p><p>Scopus Author ID 56380930700</p></bio><email xlink:type="simple">av_smirnov@mirea.ru</email><xref ref-type="aff" rid="aff-1"/></contrib></contrib-group><aff-alternatives id="aff-1"><aff xml:lang="ru"><institution>МИРЭА – Российский технологический университет</institution><country>Россия</country></aff><aff xml:lang="en"><institution>MIREA – Russian Technological University</institution><country>Russian Federation</country></aff></aff-alternatives><pub-date pub-type="collection"><year>2025</year></pub-date><pub-date pub-type="epub"><day>12</day><month>02</month><year>2025</year></pub-date><volume>13</volume><issue>2</issue><fpage>121</fpage><lpage>131</lpage><permissions><copyright-statement>Copyright &amp;#x00A9; Смирнов А.В., 2025</copyright-statement><copyright-year>2025</copyright-year><copyright-holder xml:lang="ru">Смирнов А.В.</copyright-holder><copyright-holder xml:lang="en">Smirnov A.V.</copyright-holder><license xml:lang="ru" license-type="creative-commons-attribution" xlink:href="https://creativecommons.org/licenses/by/4.0/" xlink:type="simple"><license-p>Данная работа распространяется под лицензией Creative Commons Attribution 4.0.</license-p></license><license xml:lang="en" license-type="creative-commons-attribution" xlink:href="https://creativecommons.org/licenses/by/4.0/" xlink:type="simple"><license-p>This work is licensed under a Creative Commons Attribution 4.0 License.</license-p></license></permissions><self-uri xlink:href="https://www.rtj-mirea.ru/jour/article/view/1131">https://www.rtj-mirea.ru/jour/article/view/1131</self-uri><abstract><sec><title>Цели</title><p>Цели. Целью работы является разработка метода оценки выпуклости рельефа целевой функции (ЦФ) в окрестностях экстремума, не требующего выполнения дополнительных расчетов ЦФ и сложной математической обработки, а использующего только данные, собираемые в процессе поиска экстремума.</p></sec><sec><title>Методы</title><p>Методы. Выпуклость рельефа характеризуется показателем степени степенной аппроксимации ЦФ в окрестностях экстремума. Оценка этого показателя осуществляется по парам пробных точек с учетом их расстояний до найденного экстремума и значений ЦФ в них. На основе анализа погрешностей такой оценки в методе предусмотрены отбор пробных точек по их расстояниям от найденного экстремума и отбор пар пробных точек по углу между направлениями на них из найденного экстремума. Для экспериментальной проверки метода использовались тестовые функции с различной выпуклостью, как выпуклые, так и вогнутые. В качестве метода поиска экстремума применялся алгоритм роя частиц (particle swarm optimization, PSO). Результаты экспериментов представлялись в виде статистических характеристик и гистограмм распределений значений оценки показателя степени степенной аппроксимации ЦФ.</p></sec><sec><title>Результаты</title><p>Результаты. Эксперименты показали, что при соответствующем выборе параметров отбора пробных точек и их пар метод дает достоверные значения границ диапазона, в который попадают оценки показателя степени степенной аппроксимации.</p></sec><sec><title>Выводы</title><p>Выводы. Предложенный метод может стать частью методики анализа свойств рельефа ЦФ. Для этого необходимо дополнить его алгоритмами автоматической настройки параметров отбора пробных точек и их пар. Повышение информативности метода может быть достигнуто путем анализа распределения оценок показателя степени по расстояниям пробных точек от экстремума и направлениям на них.</p></sec></abstract><trans-abstract xml:lang="en"><sec><title>Objectives</title><p>Objectives. The work set out to develop a method for estimating the objective function (OF) landscape convexity in the extremum neighborhood. The proposed method, which requires no additional OF calculations or complicated mathematical processing, relies on the data accumulated during extremum search.</p></sec><sec><title>Methods</title><p>Methods. Landscape convexity is characterized by the index of power approximation of the OF in the vicinity of the extremum. The estimation of this index is carried out for pairs of test points taking into account their distances to the found extremum and OF values in them. Based on the analysis of estimation errors, the method includes the selection of test points by their distances from the found extremum and the selection of pairs of test points by the angle between the directions to them from the found extremum. Test functions having different convexities, including concave, were used to experimentally validate the method. The particle swarm optimization algorithm was used as an extremum search method. The experimental results were presented in the form of statistical characteristics and histograms of distributions of the estimation values of the degree of the OF approximation index.</p></sec><sec><title>Results</title><p>Results. The conductive experiments confirm that the proposed method provides a reliable estimation of power index range bounds upon condition of appropriate definition of trial points and trial point pair selection parameters.</p></sec><sec><title>Conclusions</title><p>Conclusions. The proposed method may be a part of OF landscape analysis. It is necessary to complement it with the algorithms for automatic adjustment of trial points and pairs of trial points selection parameters. Additional information may be provided by analyzing the dependencies of power index estimations and trial point distances from extrema.</p></sec></trans-abstract><kwd-group xml:lang="ru"><kwd>рельеф целевой функции</kwd><kwd>выпуклая функция</kwd><kwd>вогнутая функция</kwd><kwd>степенная аппроксимация</kwd><kwd>показатель степени</kwd><kwd>гистограмма</kwd></kwd-group><kwd-group xml:lang="en"><kwd>objective function landscape</kwd><kwd>convex function</kwd><kwd>concave function</kwd><kwd>power approximation</kwd><kwd>power index</kwd><kwd>histogram</kwd></kwd-group></article-meta></front><back><ref-list><title>References</title><ref id="cit1"><label>1</label><citation-alternatives><mixed-citation xml:lang="ru">Malan K.M. A Survey of Advances in Landscape Analysis for Optimisation. Algorithms. 2021;14(2):40. https://doi.org/10.3390/a14020040</mixed-citation><mixed-citation xml:lang="en">Malan K.M. A Survey of Advances in Landscape Analysis for Optimisation. Algorithms. 2021;14(2):40. https://doi.org/10.3390/a14020040</mixed-citation></citation-alternatives></ref><ref id="cit2"><label>2</label><citation-alternatives><mixed-citation xml:lang="ru">Mersmann O., Bischl B., Trautmann H., Preuss M., Weihs C., Rudolf G. Exploratory Landscape Analysis. In: GECCO’11: Proceedings of the 13th Annual Genetic and Evolutionary Computation. 2011. P. 829–836. https://doi.org/10.1145/2001576.2001690</mixed-citation><mixed-citation xml:lang="en">Mersmann O., Bischl B., Trautmann H., Preuss M., Weihs C., Rudolf G. Exploratory Landscape Analysis. In: GECCO’11: Proceedings of the 13th Annual Genetic and Evolutionary Computation. 2011. P. 829–836. https://doi.org/10.1145/2001576.2001690</mixed-citation></citation-alternatives></ref><ref id="cit3"><label>3</label><citation-alternatives><mixed-citation xml:lang="ru">Kerschke P., Trautmann H. Comprehensive Feature-Based Landscape Analysis of Continuous and Constrained Optimization Problems Using the R-package flacco. In: Bauer N., Ickstadt K., Lübke K., Szepannek G., Trautmann H., Vichi M. (Eds.). Applications in Statistical Computing. Book Series: Studies in Classification, Data Analysis, and Knowledge Organization. Berlin/Heidelberg, Germany: Springer; 2019. P. 93–123. https://doi.org/10.1007/978-3-030-25147-5_7</mixed-citation><mixed-citation xml:lang="en">Kerschke P., Trautmann H. Comprehensive Feature-Based Landscape Analysis of Continuous and Constrained Optimization Problems Using the R-package flacco. In: Bauer N., Ickstadt K., Lübke K., Szepannek G., Trautmann H., Vichi M. (Eds.). Applications in Statistical Computing. Book Series: Studies in Classification, Data Analysis, and Knowledge Organization. Berlin/Heidelberg, Germany: Springer; 2019. P. 93–123. https://doi.org/10.1007/978-3-030-25147-5_7</mixed-citation></citation-alternatives></ref><ref id="cit4"><label>4</label><citation-alternatives><mixed-citation xml:lang="ru">Trajanov R., Dimeski S., Popovski M., Korosec P., Eftimov T. Explainable Landscape-Aware Optimization Performance Predicion. Preprint. 2021. http://arxiv.org/pdf/2110.11633v1, https://doi.org/10.48550/arXiv.2110.11633</mixed-citation><mixed-citation xml:lang="en">Trajanov R., Dimeski S., Popovski M., Korosec P., Eftimov T. Explainable Landscape-Aware Optimization Performance Predicion. Preprint. 2021. http://arxiv.org/pdf/2110.11633v1, https://doi.org/10.48550/arXiv.2110.11633</mixed-citation></citation-alternatives></ref><ref id="cit5"><label>5</label><citation-alternatives><mixed-citation xml:lang="ru">Van Stein B., Long F.X., Frenzel M., Krause P., Gitterle M., Back T. DoE2Vec: Deep-learning Based Features for Exploratory Landscape Analysis. Preprint. 2023. https://arxiv.org/pdf/2304.01219v1</mixed-citation><mixed-citation xml:lang="en">van Stein B., Long F.X., Frenzel M., Krause P., Gitterle M., Back T. DoE2Vec: Deep-learning Based Features for Exploratory Landscape Analysis. Preprint. 2023. https://arxiv.org/pdf/2304.01219v1</mixed-citation></citation-alternatives></ref><ref id="cit6"><label>6</label><citation-alternatives><mixed-citation xml:lang="ru">Поляк Б.Т. Введение в оптимизацию. М.: Наука; 1983. 384 с.</mixed-citation><mixed-citation xml:lang="en">Polyak B.T. Vvedenie v optimizatsiyu (Introduction into Optimization). Moscow: Nauka; 1983. 384 p. (in Russ.).</mixed-citation></citation-alternatives></ref><ref id="cit7"><label>7</label><citation-alternatives><mixed-citation xml:lang="ru">Nocedal J., Wright S. Numerical Optimization: 2nd ed. Springer; 2006. 684 p.</mixed-citation><mixed-citation xml:lang="en">Nocedal J., Wright S. Numerical Optimization: 2nd ed. Springer; 2006. 684 p.</mixed-citation></citation-alternatives></ref><ref id="cit8"><label>8</label><citation-alternatives><mixed-citation xml:lang="ru">Bertsimas D., ten Eikelder S.C.M., den Hertog D., Trichakis N. Pareto Adaptive Robust Optimality via a Fourier-Motzkin Elimination Lens. Math. Program. 2024;205(9):485–538. https://doi.org/10.1007/s10107-023-01983-z</mixed-citation><mixed-citation xml:lang="en">Bertsimas D., ten Eikelder S.C.M., den Hertog D., Trichakis N. Pareto Adaptive Robust Optimality via a Fourier-Motzkin Elimination Lens. Math. Program. 2024;205(9):485–538. https://doi.org/10.1007/s10107-023-01983-z</mixed-citation></citation-alternatives></ref><ref id="cit9"><label>9</label><citation-alternatives><mixed-citation xml:lang="ru">Смирнов А.В. Сравнение алгоритмов многокритериальной оптимизации характеристик радиотехнических устройств. Russian Technological Journal. 2022;10(6):42−51. https://doi.org/10.32362/2500-316X-2022-10-6-42-51</mixed-citation><mixed-citation xml:lang="en">Smirnov A.V. Comparison of algorithms for multi-objective optimization of radio technical device characteristics. Russian Technological Journal. 2022;10(6):42−51. https://doi.org/10.32362/2500-316X-2022-10-6-42-51</mixed-citation></citation-alternatives></ref><ref id="cit10"><label>10</label><citation-alternatives><mixed-citation xml:lang="ru">Doikov N., Stich S.U., Jaggi M. Spectral Preconditioning for Gradient Methods on Graded Non-convex Functions. Preprint. 2024. https://arxiv.org/pdf/2402.04843v1</mixed-citation><mixed-citation xml:lang="en">Doikov N., Stich S.U., Jaggi M. Spectral Preconditioning for Gradient Methods on Graded Non-convex Functions. Preprint. 2024. https://arxiv.org/pdf/2402.04843v1</mixed-citation></citation-alternatives></ref><ref id="cit11"><label>11</label><citation-alternatives><mixed-citation xml:lang="ru">Yaochu J. A Comprehensive Survey of Fitness Approximation in Evolutionary Computation. Soft Computing. 2005;9(1): 3–12. https://doi.org/10.1007/s00500-003-0328-5</mixed-citation><mixed-citation xml:lang="en">Yaochu J. A Comprehensive Survey of Fitness Approximation in Evolutionary Computation. Soft Computing. 2005;9(1): 3–12. https://doi.org/10.1007/s00500-003-0328-5</mixed-citation></citation-alternatives></ref><ref id="cit12"><label>12</label><citation-alternatives><mixed-citation xml:lang="ru">Hong L.J., Zhang X. Surrogate-Based Simulation Optimization. Preprint. 2021. https://arxiv.org/pdf/2105.03893v1</mixed-citation><mixed-citation xml:lang="en">Hong L.J., Zhang X. Surrogate-Based Simulation Optimization. Preprint. 2021. https://arxiv.org/pdf/2105.03893v1</mixed-citation></citation-alternatives></ref><ref id="cit13"><label>13</label><citation-alternatives><mixed-citation xml:lang="ru">Карпенко А.П. Современные алгоритмы поисковой оптимизации. Алгоритмы, вдохновленные природой: 3-е изд. М.: Изд-во МГТУ им. Н.Э. Баумана; 2021. 448 с.</mixed-citation><mixed-citation xml:lang="en">Karpenko A.P. Sovremennye algoritmy poiskovoi optimizatsii. Algoritmy, vdokhnovlennye prirodoi (Modern Search Optimization Algorithms. Nature-Inspired Optimization Algorithms): 3rd ed. Moscow: Baumann Press; 2021. 448 p. (in Russ.).</mixed-citation></citation-alternatives></ref><ref id="cit14"><label>14</label><citation-alternatives><mixed-citation xml:lang="ru">Смирнов А.В. Свойства целевых функций и алгоритмов поиска в задачах многокритериальной оптимизации. Russian Technological Journal. 2022;10(4):75−85. https://doi.org/10.32362/2500-316X-2022-10-4-75-85</mixed-citation><mixed-citation xml:lang="en">Smirnov A.V. Properties of objective functions and search algorithms in multi-objective optimization problems. Russian Technological Journal. 2022;10(4):75−85. https://doi.org/10.32362/2500-316X-2022-10-4-75-85</mixed-citation></citation-alternatives></ref><ref id="cit15"><label>15</label><citation-alternatives><mixed-citation xml:lang="ru">Hansen N., Finck S., Ros R., Auger A. Real-Parameter Black-Box Optimization Benchmarking 2009: Noiseless Functions Definitions. [Research Report] RR-6829. INRIA; 2009. URL: https://hal.inria.fr/inria-00362633v2</mixed-citation><mixed-citation xml:lang="en">Hansen N., Finck S., Ros R., Auger A. Real-Parameter Black-Box Optimization Benchmarking 2009: Noiseless Functions Definitions. [Research Report] RR-6829. INRIA; 2009. Available from URL: https://hal.inria.fr/inria-00362633v2</mixed-citation></citation-alternatives></ref><ref id="cit16"><label>16</label><citation-alternatives><mixed-citation xml:lang="ru">Hansen N. The CMA Evolution Strategy: A Tutorial. Preprint. 2016. https://arxiv.org/abs/1604.00772v2</mixed-citation><mixed-citation xml:lang="en">Hansen N. The CMA Evolution Strategy: A Tutorial. Preprint. 2016. https://arxiv.org/abs/1604.00772v2</mixed-citation></citation-alternatives></ref></ref-list><fn-group><fn fn-type="conflict"><p>The authors declare that there are no conflicts of interest present.</p></fn></fn-group></back></article>
