<?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">mathematics</journal-id><journal-title-group><journal-title xml:lang="ru">Вестник российских университетов. Математика</journal-title><trans-title-group xml:lang="en"><trans-title>Russian Universities Reports. Mathematics</trans-title></trans-title-group></journal-title-group><issn pub-type="ppub">2686-9667</issn><issn pub-type="epub">2782-3342</issn><publisher><publisher-name>Тамбовский государственный университет имени Г.Р. Державина</publisher-name></publisher></journal-meta><article-meta><article-id pub-id-type="doi">10.20310/2686-9667-2024-29-148-401-424</article-id><article-id custom-type="elpub" pub-id-type="custom">mathematics-81</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>ARTICLES</subject></subj-group></article-categories><title-group><article-title>Ускорение сходимости ньютоновских методов</article-title><trans-title-group xml:lang="en"><trans-title>Accelerating convergence of Newton-type methods</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-0001-9851-0524</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>Izmailov</surname><given-names>Alexey F.</given-names></name></name-alternatives><email xlink:type="simple">izmaf@cs.msu.ru</email><xref ref-type="aff" rid="aff-1"/></contrib><contrib contrib-type="author" corresp="yes"><contrib-id contrib-id-type="orcid">https://orcid.org/0000-0002-3639-0317</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>Uskov</surname><given-names>Evgeniy I.</given-names></name></name-alternatives><email xlink:type="simple">euskov@cs.msu.ru</email><xref ref-type="aff" rid="aff-2"/></contrib></contrib-group><aff-alternatives id="aff-1"><aff xml:lang="ru"><institution>ФГБОУ ВО «Московский государственный университет им. М. В. Ломоносова»</institution><country>Россия</country></aff><aff xml:lang="en"><institution>Lomonosov Moscow State University</institution><country>Russian Federation</country></aff></aff-alternatives><aff-alternatives id="aff-2"><aff xml:lang="ru"><institution>ФГБОУ ВО «Тамбовский государственный университет им. Г. Р. Державина»</institution><country>Россия</country></aff><aff xml:lang="en"><institution>Derzhavin Tambov State University</institution><country>Russian Federation</country></aff></aff-alternatives><pub-date pub-type="collection"><year>2024</year></pub-date><pub-date pub-type="epub"><day>25</day><month>12</month><year>2024</year></pub-date><volume>29</volume><issue>148</issue><fpage>401</fpage><lpage>424</lpage><permissions><copyright-statement>Copyright &amp;#x00A9; Измаилов А.Ф., Усков Е.И., 2024</copyright-statement><copyright-year>2024</copyright-year><copyright-holder xml:lang="ru">Измаилов А.Ф., Усков Е.И.</copyright-holder><copyright-holder xml:lang="en">Izmailov A.F., Uskov E.I.</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://mathematics.elpub.ru/jour/article/view/81">https://mathematics.elpub.ru/jour/article/view/81</self-uri><abstract><p>Рассматривается простейшая процедура экстраполяции, а именно, удвоение шага, для ускорения сходимости ньютоновских методов к особым решениям гладких нелинейных уравнений. Демонстрируется, что ускоряющий эффект этой процедуры для разных ньютоновских методов может быть разным. Для линейно-квадратичных уравнений приводятся теоретические результаты, дающие количественные оценки потенциального эффекта от экстраполяции для методов Ньютона, Левенберга–Марквардта, а также недавно предложенного ньютоновского метода с подзадачами линейного программирования, в определенном смысле объясняющие наблюдаемую разницу. Теоретически анализ основан на интерпретации этих методов как возмущенного метода Ньютона с соответствующими оценками на возмущения, а также на тонких результатах, количественно характеризующих шаг такого возмущенного метода и его локальную сходимость с линейной скоростью к особым решениям, в которых выполняется условие 2-регулярности по направлению из ядра первой производной. Также проводятся численные эксперименты для глобализаций указанных алгоритмов, снабженных выбором параметра длины шага, на двух тестовых наборах. Экспериментальные наблюдения подтверждают теоретические результаты, а также демонстрируют, что в случаях, когда уравнение содержит нелинейные и неквадратичные члены, эффект от экстраполяции выравнивается.</p></abstract><trans-abstract xml:lang="en"><p>We consider the simplest extrapolation procedure, specifically doubling the step, intended for acceleration of convergence of Newton-type methods to singular solutions of smooth nonlinear equations. We demonstrate that the acceleration effect of this procedure can be different for different Newton-type methods. For linear-quadratic equations we provide theoretical results yielding quantitative estimates of the potential effect of extrapolation for the Newton method, for the Levenberg–Marquardt method, and for the recently proposed LP-Newton method, in some sense explaining the observed difference. Theoretical analysis relies on interpretation of these methods as a perturbed Newton method with the appropriate estimates of perturbations, as well as on sharp results yielding a quantitative characterization of a step of such perturbed method, and its local convergence at a linear rate to singular solutions satisfying the 2-regularity condition in a direction from the null space of the first derivative. Furthermore, we perform numerical experiments with globalized versions of the algorithms in question, equipped with choosing the stepsize parameter, on two sets of test problems. Experimental observations confirm the theoretical results, and also demonstrate that in cases when the equation contains nonlinear and nonquadratic terms, the effect of extrapolation is evened out.</p></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>nonlinear equation</kwd><kwd>singular solution</kwd><kwd>Newton method</kwd><kwd>Levenberg–Marquardt method</kwd><kwd>LP-Newton method</kwd><kwd>extrapolation</kwd></kwd-group><funding-group><funding-statement xml:lang="ru">Исследование выполнено за счет гранта Российского научного фонда (проект № 24-21-00015, https://rscf.ru/project/24-21-00015/https://rscf.ru/project/24-21-00015/)</funding-statement><funding-statement xml:lang="en">The research was supported by the Russian Science Foundation (project no. 24-21-00015, https://rscf.ru/en/project/24-21-00015/https://rscf.ru/project/24-21-00015/)</funding-statement></funding-group></article-meta></front><back><ref-list><title>References</title><ref id="cit1"><label>1</label><citation-alternatives><mixed-citation xml:lang="ru">A. Griewank, Analysis and Modification of Newton’s Method at Singularities, PhD Thesis, Australian National University, Canberra, 1980.</mixed-citation><mixed-citation xml:lang="en">A. Griewank, Analysis and Modification of Newton’s Method at Singularities, PhD Thesis, Australian National University, Canberra, 1980.</mixed-citation></citation-alternatives></ref><ref id="cit2"><label>2</label><citation-alternatives><mixed-citation xml:lang="ru">A. Griewank, “On solving nonlinear equations with simple singularities or nearly singular solutions”, SIAM Review, 27 (1985), 537–563.</mixed-citation><mixed-citation xml:lang="en">A. Griewank, “On solving nonlinear equations with simple singularities or nearly singular solutions”, SIAM Review, 27 (1985), 537–563.</mixed-citation></citation-alternatives></ref><ref id="cit3"><label>3</label><citation-alternatives><mixed-citation xml:lang="ru">A. F. Izmailov, M. V. Solodov, Newton-Type Methods for Optimization and Variational Problems, Springer Series in Operations Research and Financial Engineering, Springer, Cham, 2014, 573 pp.</mixed-citation><mixed-citation xml:lang="en">A. F. Izmailov, M. V. Solodov, Newton-Type Methods for Optimization and Variational Problems, Springer Series in Operations Research and Financial Engineering, Springer, Cham, 2014, 573 pp.</mixed-citation></citation-alternatives></ref><ref id="cit4"><label>4</label><citation-alternatives><mixed-citation xml:lang="ru">K. Levenberg, “A method for the solution of certain non-linear problems in least squares”, Quarterly of Applied Mathematics, 2 (1944), 164–168.</mixed-citation><mixed-citation xml:lang="en">K. Levenberg, “A method for the solution of certain non-linear problems in least squares”, Quarterly of Applied Mathematics, 2 (1944), 164–168.</mixed-citation></citation-alternatives></ref><ref id="cit5"><label>5</label><citation-alternatives><mixed-citation xml:lang="ru">D. W. Marquardt, “An algorithm for least squares estimation of non-linear parameters”, SIAM J., 11 (1963), 431–441.</mixed-citation><mixed-citation xml:lang="en">D. W. Marquardt, “An algorithm for least squares estimation of non-linear parameters”, SIAM J., 11 (1963), 431–441.</mixed-citation></citation-alternatives></ref><ref id="cit6"><label>6</label><citation-alternatives><mixed-citation xml:lang="ru">Дж. Дэннис, Р. Шнабель, Численные методы безусловной оптимизации и решение нелинейных уравнений, Мир, М., 1988; англ. ориг.:J. E. Dennis, Jr., R. B. Schnabel, Numerical Methods for Unconstrained Optimization and Nonlinear Equations, Prentice-Hall, Inc., Englewood Cliffs, 1983.</mixed-citation><mixed-citation xml:lang="en">Дж. Дэннис, Р. Шнабель, Численные методы безусловной оптимизации и решение нелинейных уравнений, Мир, М., 1988; англ. ориг.:J. E. Dennis, Jr., R. B. Schnabel, Numerical Methods for Unconstrained Optimization and Nonlinear Equations, Prentice-Hall, Inc., Englewood Cliffs, 1983.</mixed-citation></citation-alternatives></ref><ref id="cit7"><label>7</label><citation-alternatives><mixed-citation xml:lang="ru">A. Fischer, A. F. Izmailov, M. V. Solodov, “The Levenberg–Marquardt method: an overview of modern convergence theories and more”, Computational Optimization and Applications, 89:1 (2024), 33–67.</mixed-citation><mixed-citation xml:lang="en">A. Fischer, A. F. Izmailov, M. V. Solodov, “The Levenberg–Marquardt method: an overview of modern convergence theories and more”, Computational Optimization and Applications, 89:1 (2024), 33–67.</mixed-citation></citation-alternatives></ref><ref id="cit8"><label>8</label><citation-alternatives><mixed-citation xml:lang="ru">F. Facchinei, A. Fischer, M. Herrich, “An LP-Newton method: Nonsmooth equations, KKT systems, and nonisolated solutions”, Mathematical Programming, 146 (2014), 1–36.</mixed-citation><mixed-citation xml:lang="en">F. Facchinei, A. Fischer, M. Herrich, “An LP-Newton method: Nonsmooth equations, KKT systems, and nonisolated solutions”, Mathematical Programming, 146 (2014), 1–36.</mixed-citation></citation-alternatives></ref><ref id="cit9"><label>9</label><citation-alternatives><mixed-citation xml:lang="ru">А. Ф. Измаилов, А. А. Третьяков, 2-регулярные решения нелинейных задач. Теория и чис¬ленные методы, Физматлит, М., 1999. [A. F. Izmailov, A. A. Tret’yakov, 2-Regular Solutions of Nonlinear Problems. Theorey and Numerical Methods, Fizmatlit Publ., Moscow, 1999 (In Russian)].</mixed-citation><mixed-citation xml:lang="en">А. Ф. Измаилов, А. А. Третьяков, 2-регулярные решения нелинейных задач. Теория и чис¬ленные методы, Физматлит, М., 1999. [A. F. Izmailov, A. A. Tret’yakov, 2-Regular Solutions of Nonlinear Problems. Theorey and Numerical Methods, Fizmatlit Publ., Moscow, 1999 (In Russian)].</mixed-citation></citation-alternatives></ref><ref id="cit10"><label>10</label><citation-alternatives><mixed-citation xml:lang="ru">A. F. Izmailov, A. S. Kurennoy, M. V. Solodov, “Critical solutions of nonlinear equations: local attraction for Newton-type methods”, Mathematical Programming, 167:2 (2018), 355–379.</mixed-citation><mixed-citation xml:lang="en">A. F. Izmailov, A. S. Kurennoy, M. V. Solodov, “Critical solutions of nonlinear equations: local attraction for Newton-type methods”, Mathematical Programming, 167:2 (2018), 355–379.</mixed-citation></citation-alternatives></ref><ref id="cit11"><label>11</label><citation-alternatives><mixed-citation xml:lang="ru">A. Fischer, A. F. Izmailov, M. Jelitte, “Behavior of Newton-type methods near critical solutions of nonlinear equations with semismooth derivatives”, Journal of Optimization Theory and</mixed-citation><mixed-citation xml:lang="en">A. Fischer, A. F. Izmailov, M. Jelitte, “Behavior of Newton-type methods near critical solutions of nonlinear equations with semismooth derivatives”, Journal of Optimization Theory and</mixed-citation></citation-alternatives></ref><ref id="cit12"><label>12</label><citation-alternatives><mixed-citation xml:lang="ru">Applications, 2023, New Trends in Optimization, Control, and Their Applications: A Special Issue Dedicated to Boris Sh. Mordukhovich.</mixed-citation><mixed-citation xml:lang="en">Applications, 2023, New Trends in Optimization, Control, and Their Applications: A Special Issue Dedicated to Boris Sh. Mordukhovich.</mixed-citation></citation-alternatives></ref><ref id="cit13"><label>13</label><citation-alternatives><mixed-citation xml:lang="ru">A. Fischer, A. F. Izmailov, M. V. Solodov, “Accelerating convergence of the globalized Newton method to critical solutions of nonlinear equations”, Computational Optimization and Applications, 78:1 (2021), 273–286.</mixed-citation><mixed-citation xml:lang="en">A. Fischer, A. F. Izmailov, M. V. Solodov, “Accelerating convergence of the globalized Newton method to critical solutions of nonlinear equations”, Computational Optimization and Applications, 78:1 (2021), 273–286.</mixed-citation></citation-alternatives></ref><ref id="cit14"><label>14</label><citation-alternatives><mixed-citation xml:lang="ru">A. Fischer, A. F. Izmailov, M. V. Solodov, “Unit stepsize for the Newton method close to critical solutions”, Mathematical Programming, 187:1–2 (2021), 697–721.</mixed-citation><mixed-citation xml:lang="en">A. Fischer, A. F. Izmailov, M. V. Solodov, “Unit stepsize for the Newton method close to critical solutions”, Mathematical Programming, 187:1–2 (2021), 697–721.</mixed-citation></citation-alternatives></ref><ref id="cit15"><label>15</label><citation-alternatives><mixed-citation xml:lang="ru">A. Fischer, A. F. Izmailov, M. Jelitte, “Newton-type methods near critical solutions of piecewise smooth nonlinear equations”, Computational Optimization and Applications, 80:2 (2021), 587– 615.</mixed-citation><mixed-citation xml:lang="en">A. Fischer, A. F. Izmailov, M. Jelitte, “Newton-type methods near critical solutions of piecewise smooth nonlinear equations”, Computational Optimization and Applications, 80:2 (2021), 587– 615.</mixed-citation></citation-alternatives></ref><ref id="cit16"><label>16</label><citation-alternatives><mixed-citation xml:lang="ru">A. Griewank, “Starlike domains of convergence for Newton’s method at singularities”, Numerische Mathematik, 35 (1980), 95–111.</mixed-citation><mixed-citation xml:lang="en">A. Griewank, “Starlike domains of convergence for Newton’s method at singularities”, Numerische Mathematik, 35 (1980), 95–111.</mixed-citation></citation-alternatives></ref><ref id="cit17"><label>17</label><citation-alternatives><mixed-citation xml:lang="ru">A. Fischer, P. K. Shukla, “A Levenberg–Marquardt algorithm for unconstrained multicriteria optimization”, Operations Research Letters, 36 (2008), 643–646.</mixed-citation><mixed-citation xml:lang="en">A. Fischer, P. K. Shukla, “A Levenberg–Marquardt algorithm for unconstrained multicriteria optimization”, Operations Research Letters, 36 (2008), 643–646.</mixed-citation></citation-alternatives></ref><ref id="cit18"><label>18</label><citation-alternatives><mixed-citation xml:lang="ru">A. Fischer, M. Herrich, A. F. Izmailov, M. V. Solodov, “A globally convergent LP-Newton method”, SIAM J. on Optimization, 26 (2016), 2012–2033.</mixed-citation><mixed-citation xml:lang="en">A. Fischer, M. Herrich, A. F. Izmailov, M. V. Solodov, “A globally convergent LP-Newton method”, SIAM J. on Optimization, 26 (2016), 2012–2033.</mixed-citation></citation-alternatives></ref><ref id="cit19"><label>19</label><citation-alternatives><mixed-citation xml:lang="ru">J. J. Moré, B. S. Garbow, K. E. Hillstrom, “Testing unconstrained optimization software”, ACM Transactions of Mathematical Software, 7 (1981), 17–41.</mixed-citation><mixed-citation xml:lang="en">J. J. Moré, B. S. Garbow, K. E. Hillstrom, “Testing unconstrained optimization software”, ACM Transactions of Mathematical Software, 7 (1981), 17–41.</mixed-citation></citation-alternatives></ref><ref id="cit20"><label>20</label><citation-alternatives><mixed-citation xml:lang="ru">R. B. Schnabel, P. D. Frank, “Tensor methods for nonlinear equations”, SIAM J. on Numerical Analysis, 21 (1984), 815–843.</mixed-citation><mixed-citation xml:lang="en">R. B. Schnabel, P. D. Frank, “Tensor methods for nonlinear equations”, SIAM J. on Numerical Analysis, 21 (1984), 815–843.</mixed-citation></citation-alternatives></ref><ref id="cit21"><label>21</label><citation-alternatives><mixed-citation xml:lang="ru">E. D. Dolan, J. J. More, “Benchmarking optimization software with performance profiles”, Mathematical Programming, 91 (2002), 201–213.</mixed-citation><mixed-citation xml:lang="en">E. D. Dolan, J. J. More, “Benchmarking optimization software with performance profiles”, Mathematical Programming, 91 (2002), 201–213.</mixed-citation></citation-alternatives></ref><ref id="cit22"><label>22</label><citation-alternatives><mixed-citation xml:lang="ru">A. F. Izmailov, M. V. Solodov, E. I. Uskov, “Combining stabilized SQP with the augmented Lagrangian algorithm”, Computational Optimization and Applications, 62 (2015), 405–429.</mixed-citation><mixed-citation xml:lang="en">A. F. Izmailov, M. V. Solodov, E. I. Uskov, “Combining stabilized SQP with the augmented Lagrangian algorithm”, Computational Optimization and Applications, 62 (2015), 405–429.</mixed-citation></citation-alternatives></ref><ref id="cit23"><label>23</label><citation-alternatives><mixed-citation xml:lang="ru">А. Ф. Измаилов, “О новых реализациях 2-фактор-метода”, Журнал вычислительной матемематики и математической физики, 55:6 (2015), 933–946; англ. пер.:A. F. Izmailov, “New implementations of the 2-factor method”, Computational Mathematics and Mathematical Physics, 55:6 (2015), 922–934.</mixed-citation><mixed-citation xml:lang="en">А. Ф. Измаилов, “О новых реализациях 2-фактор-метода”, Журнал вычислительной матемематики и математической физики, 55:6 (2015), 933–946; англ. пер.:A. F. Izmailov, “New implementations of the 2-factor method”, Computational Mathematics and Mathematical Physics, 55:6 (2015), 922–934.</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>
