<?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-2026-31-154-142-167</article-id><article-id custom-type="elpub" pub-id-type="custom">mathematics-365</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>ORIGINAL ARTICLES</subject></subj-group></article-categories><title-group><article-title>Ускорение сходимости кусочного метода Ньютона к особым решениям нелинейных уравнений</article-title><trans-title-group xml:lang="en"><trans-title>Acceleration of convergence of the piecewise Newton method to singular solutions of nonlinear equations</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><bio xml:lang="ru"><p>Измаилов Алексей Феридович, доктор физико-математических наук, профессор кафедры исследования операций    </p><p>119991, ГСП-2, г. Москва, Ленинские горы, 1</p></bio><bio xml:lang="en"><p>Alexey F. Izmailov, Doctor of Physical and Mathematical Sciences, Professor of the Operations Research Department    </p><p>1 Leninskiye Gory, Moscow 119991</p></bio><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/0009-0003-6425-0332</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>Yan</surname><given-names>Zhibai</given-names></name></name-alternatives><bio xml:lang="ru"><p>Янь Чжибай, аспирант    </p><p>119991, ГСП-2, г. Москва, Ленинские горы, 1</p></bio><bio xml:lang="en"><p>Zhibai Yan, Post-Graduate Student    </p><p>1 Leninskiye Gory, Moscow 119991</p></bio><email xlink:type="simple">yanzhibai@cs.msu.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>Lomonosov Moscow State University</institution><country>Russian Federation</country></aff></aff-alternatives><pub-date pub-type="collection"><year>2026</year></pub-date><pub-date pub-type="epub"><day>06</day><month>07</month><year>2026</year></pub-date><volume>31</volume><issue>154</issue><fpage>142</fpage><lpage>167</lpage><permissions><copyright-statement>Copyright &amp;#x00A9; Измаилов А.Ф., Янь Ч., 2026</copyright-statement><copyright-year>2026</copyright-year><copyright-holder xml:lang="ru">Измаилов А.Ф., Янь Ч.</copyright-holder><copyright-holder xml:lang="en">Izmailov A.F., Yan Z.</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/365">https://mathematics.elpub.ru/jour/article/view/365</self-uri><abstract><p>Статья посвящена способам ускорения сходимости вариантов метода Ньютона к особым решениям системы нелинейных уравнений. Для уравнений с гладкими отображениями литература, посвященная этим вопросам, весьма обширна. В частности, известно, что в естественных предположениях имеет место линейная сходимость базового метода Ньютона к особым решениям, с асимптотическим общим частным 1/2, из широких областей начальных точек. Используя специальный характер такой сходимости, ее можно в определенных смыслах ускорить за счет соответствующих модификаций базового метода Ньютона, а именно, процедур экстраполяции и оверрелаксации. Помимо обзора соответствующих теорий локальной сходимости, основные результаты работы состоят в распространении указанных алгоритмов и теорем об их локальной сходимости и скорости сходимости на кусочный метод Ньютона для уравнений с кусочно-гладким отображением. Важную роль при этом играют разработанные ранее конструкции, позволяющие охарактеризовать гладкие кусочные отображения, которые могут быть активными на итерациях методов. Статья также содержит результаты численного сравнения рассматриваемых способов ускорения кусочного метода Ньютона на кусочно-гладких переформулировках нелинейных комплементарных задач, включая некоторые иллюстративные примеры.</p></abstract><trans-abstract xml:lang="en"><p>This paper is devoted to techniques intended for acceleration of convergence of the variants of the Newton method to singular solutions of systems of nonlinear equations. For equations with smooth mappings, there exists a rich literature on these issues. In particular, it is known that under natural assumptions, the rate of convergence of the basic Newton method to singular solutions is linear, with the asymptotic common ratio equal to 1/2, from wide domains of starting points. Making use of a special pattern of such convergence, it can be in some senses accelerated by introducing the corresponding modifications of the basic Newton method, namely, the extrapolation and overrelaxation procedures. Besides providing a survey of the related local convergence theories, the main results of the paper consist of extensions of the specified algorithms and their local convergence and rate-of-convergence theorems to the piecewise Newton method for equations with piecewise smooth mappings. The important role in this is played by previously developed constructions allowing to characterize smooth local selection mappings that can be active along the iterations of the method. The paper also contains the results of numerical comparison of the considered acceleration techniques for the piecewise Newton method for piecewise-smooth reformulations of nonlinear complementarity problems, including some illustrative examples.</p></trans-abstract><kwd-group xml:lang="ru"><kwd>нелинейное уравнение</kwd><kwd>кусочно-гладкое уравнение</kwd><kwd>кусочный метод Ньютона</kwd><kwd>линейная сходимость</kwd><kwd>сверхлинейная сходимость</kwd><kwd>экстраполяция</kwd><kwd>оверрелаксация</kwd><kwd>ускорение Андерсона</kwd></kwd-group><kwd-group xml:lang="en"><kwd>nonlinear equation</kwd><kwd>piecewise smooth equation</kwd><kwd>piecewise Newton method</kwd><kwd>linear convergence</kwd><kwd>superlinear convergence</kwd><kwd>extrapolation</kwd><kwd>overrelaxation</kwd><kwd>Anderson acceleration</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">A. Griewank, “On solving nonlinear equations with simple singularities or nearly singular solutions”, SIAM Rev., 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 Rev., 27 (1985), 537–563.</mixed-citation></citation-alternatives></ref><ref id="cit2"><label>2</label><citation-alternatives><mixed-citation xml:lang="ru">D. G. Anderson, “Iterative procedures for nonlinear integral equations”, J. Assoc. Comput. Mach., 12:4 (1965), 547–560.</mixed-citation><mixed-citation xml:lang="en">D. G. Anderson, “Iterative procedures for nonlinear integral equations”, J. Assoc. Comput. Mach., 12:4 (1965), 547–560.</mixed-citation></citation-alternatives></ref><ref id="cit3"><label>3</label><citation-alternatives><mixed-citation xml:lang="ru">M. Dallas, S. Pollock, “Newton–Anderson at singular points”, Int. J. Numer. Anal. Mod., 20:5 (2023), 667–692.</mixed-citation><mixed-citation xml:lang="en">M. Dallas, S. Pollock, “Newton–Anderson at singular points”, Int. J. Numer. Anal. Mod., 20:5 (2023), 667–692.</mixed-citation></citation-alternatives></ref><ref id="cit4"><label>4</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”, Comput. Optim. Appl., 80 (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”, Comput. Optim. Appl., 80 (2021), 587–615.</mixed-citation></citation-alternatives></ref><ref id="cit5"><label>5</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.</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.</mixed-citation></citation-alternatives></ref><ref id="cit6"><label>6</label><citation-alternatives><mixed-citation xml:lang="ru">A. Griewank, “Starlike domains of convergence for Newton’s method at singularities”, Numer. Math., 35 (1980), 95–111.</mixed-citation><mixed-citation xml:lang="en">A. Griewank, “Starlike domains of convergence for Newton’s method at singularities”, Numer. Math., 35 (1980), 95–111.</mixed-citation></citation-alternatives></ref><ref id="cit7"><label>7</label><citation-alternatives><mixed-citation xml:lang="ru">A. F. Izmailov, M. V. Solodov, “A general perturbed Newtonian framework and critical solutions of nonlinear equations”, Set-Valued Var. Anal., 33:1 (2025), art. no. 3.</mixed-citation><mixed-citation xml:lang="en">A. F. Izmailov, M. V. Solodov, “A general perturbed Newtonian framework and critical solutions of nonlinear equations”, Set-Valued Var. Anal., 33:1 (2025), art. no. 3.</mixed-citation></citation-alternatives></ref><ref id="cit8"><label>8</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”, Math. Program., 187 (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”, Math. Program., 187 (2021), 697–721.</mixed-citation></citation-alternatives></ref><ref id="cit9"><label>9</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”, Math. Program., 167 (2018), 335–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”, Math. Program., 167 (2018), 335–379.</mixed-citation></citation-alternatives></ref><ref id="cit10"><label>10</label><citation-alternatives><mixed-citation xml:lang="ru">D. W. Decker, H. B. Keller, C. T. Kelley, “Convergence rates for Newton’s method at singular points”, SIAM J. Numer. Anal., 20 (1983), 296–314.</mixed-citation><mixed-citation xml:lang="en">D. W. Decker, H. B. Keller, C. T. Kelley, “Convergence rates for Newton’s method at singular points”, SIAM J. Numer. Anal., 20 (1983), 296–314.</mixed-citation></citation-alternatives></ref><ref id="cit11"><label>11</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="cit12"><label>12</label><citation-alternatives><mixed-citation xml:lang="ru">Дж. Ортега, В. Рейнболдт, Итерационные методы решения нелинейных систем уравнений co многими неизвестными, Мир, М., 1975; англ. ориг.</mixed-citation><mixed-citation xml:lang="en">J. M. Ortega, W. C. Rheinboldt, Iterative Solution of Nonlinear Equations in Several Variables, Academic Press, New York, London, 1970.</mixed-citation></citation-alternatives></ref><ref id="cit13"><label>13</label><citation-alternatives><mixed-citation xml:lang="ru">C. T. Kelley, R. Suresh, “A new acceleration method for Newton’s method at singular points”, SIAM J. Numer. Anal., 20 (1983), 1001–1009.</mixed-citation><mixed-citation xml:lang="en">C. T. Kelley, R. Suresh, “A new acceleration method for Newton’s method at singular points”, SIAM J. Numer. Anal., 20 (1983), 1001–1009.</mixed-citation></citation-alternatives></ref><ref id="cit14"><label>14</label><citation-alternatives><mixed-citation xml:lang="ru">H.-D. Ebbinghaus, H. Hermes, F. Hirzebruch, M. Koecher, K. Mainzer, J. Neukirch, A. Prestel, R. Remmert, Numbers, Springer, New York, 1991.</mixed-citation><mixed-citation xml:lang="en">H.-D. Ebbinghaus, H. Hermes, F. Hirzebruch, M. Koecher, K. Mainzer, J. Neukirch, A. Prestel, R. Remmert, Numbers, Springer, New York, 1991.</mixed-citation></citation-alternatives></ref><ref id="cit15"><label>15</label><citation-alternatives><mixed-citation xml:lang="ru">S. Pollock, L. G. Rebholtz, “Anderson acceleration for contractive and noncontractive operators”, IMA J. Numer. Anal., 41 (2021), 2841–2872.</mixed-citation><mixed-citation xml:lang="en">S. Pollock, L. G. Rebholtz, “Anderson acceleration for contractive and noncontractive operators”, IMA J. Numer. Anal., 41 (2021), 2841–2872.</mixed-citation></citation-alternatives></ref><ref id="cit16"><label>16</label><citation-alternatives><mixed-citation xml:lang="ru">M. Dallas, S. Pollock, L. G. Rebholtz, “Analysis of an adaptive safeguarded Newton–Anderson algorithm of depth one with applications to fluid problems”, J. Adv. Comp. Sci. Eng., 2:3 (2024), 246–270.</mixed-citation><mixed-citation xml:lang="en">M. Dallas, S. Pollock, L. G. Rebholtz, “Analysis of an adaptive safeguarded Newton–Anderson algorithm of depth one with applications to fluid problems”, J. Adv. Comp. Sci. Eng., 2:3 (2024), 246–270.</mixed-citation></citation-alternatives></ref><ref id="cit17"><label>17</label><citation-alternatives><mixed-citation xml:lang="ru">L. G. Rebholtz, M. Xiao, “The effect of Anderson acceleration on superlinear and sublinear convergence”, J. Adv. Comp. Sci. Eng., 96 (2023), art. no. 34.</mixed-citation><mixed-citation xml:lang="en">L. G. Rebholtz, M. Xiao, “The effect of Anderson acceleration on superlinear and sublinear convergence”, J. Adv. Comp. Sci. Eng., 96 (2023), art. no. 34.</mixed-citation></citation-alternatives></ref><ref id="cit18"><label>18</label><citation-alternatives><mixed-citation xml:lang="ru">M. Dallas, “Anderson acceleration for perturbed Newton methods”, 2025 arXiv:2508.12513.</mixed-citation><mixed-citation xml:lang="en">M. Dallas, “Anderson acceleration for perturbed Newton methods”, 2025 arXiv:2508.12513.</mixed-citation></citation-alternatives></ref><ref id="cit19"><label>19</label><citation-alternatives><mixed-citation xml:lang="ru">S. Pollock, “Fast convergence to higher multiplicity zeros”, 2019 arXiv:1911.10647.</mixed-citation><mixed-citation xml:lang="en">S. Pollock, “Fast convergence to higher multiplicity zeros”, 2019 arXiv:1911.10647.</mixed-citation></citation-alternatives></ref><ref id="cit20"><label>20</label><citation-alternatives><mixed-citation xml:lang="ru">S. Pollock, H. Schwartz, “Benchmarking results for the Newton-Anderson method”, Res. Appl. Math., 8 (2020), art. no. 100095.</mixed-citation><mixed-citation xml:lang="en">S. Pollock, H. Schwartz, “Benchmarking results for the Newton-Anderson method”, Res. Appl. Math., 8 (2020), art. no. 100095.</mixed-citation></citation-alternatives></ref><ref id="cit21"><label>21</label><citation-alternatives><mixed-citation xml:lang="ru">F. Facchinei, J.-S. Pang, Finite-Dimensional Variational Inequalities and Complementarity Problems, Springer, New York, 2003.</mixed-citation><mixed-citation xml:lang="en">F. Facchinei, J.-S. Pang, Finite-Dimensional Variational Inequalities and Complementarity Problems, Springer, New York, 2003.</mixed-citation></citation-alternatives></ref><ref id="cit22"><label>22</label><citation-alternatives><mixed-citation xml:lang="ru">C. Oberlin, S. J. Wright, “An accelerated Newton method for equations with semismooth Jacobians and nonlinear complementarity problems”, Math. Program., 117 (2009), 355–386.</mixed-citation><mixed-citation xml:lang="en">C. Oberlin, S. J. Wright, “An accelerated Newton method for equations with semismooth Jacobians and nonlinear complementarity problems”, Math. Program., 117 (2009), 355–386.</mixed-citation></citation-alternatives></ref><ref id="cit23"><label>23</label><citation-alternatives><mixed-citation xml:lang="ru">A. Izmailov, E. Uskov, Z. Yan, “Newton method vs. semismooth Newton method for singular solutions of nonlinear complementarity problems”, Adv. Syst. Sci. Appl., 23 (2023), 16–26.</mixed-citation><mixed-citation xml:lang="en">A. Izmailov, E. Uskov, Z. Yan, “Newton method vs. semismooth Newton method for singular solutions of nonlinear complementarity problems”, Adv. Syst. Sci. Appl., 23 (2023), 16–26.</mixed-citation></citation-alternatives></ref><ref id="cit24"><label>24</label><citation-alternatives><mixed-citation xml:lang="ru">A. F. Izmailov, A. V. Arutyunov, “Stability of possibly nonisolated solutions of constrained equations with applications to complementarity and equilibrium problems”, Set-Valued Var. Anal., 26 (2018), 327–352.</mixed-citation><mixed-citation xml:lang="en">A. F. Izmailov, A. V. Arutyunov, “Stability of possibly nonisolated solutions of constrained equations with applications to complementarity and equilibrium problems”, Set-Valued Var. Anal., 26 (2018), 327–352.</mixed-citation></citation-alternatives></ref><ref id="cit25"><label>25</label><citation-alternatives><mixed-citation xml:lang="ru">А. Н. Дарьина, А. Ф. Измаилов, “Об идентификации активных индексов в смешанных комплементарных задачах”, Вопросы моделирования и анализа в задачах принятия решений, ВЦ РАН, М., 2004, 72–87.</mixed-citation><mixed-citation xml:lang="en">A. N. Daryina, A. F. Izmailov, “On the identification of active indices in mixed complementary problems”, Modeling and analysis issues in decision making problems, Computing Center of the Russian Academy of Sciences, Moscow, 2004, 72–87 (In Russian).</mixed-citation></citation-alternatives></ref><ref id="cit26"><label>26</label><citation-alternatives><mixed-citation xml:lang="ru">A. F. Izmailov, M. V. Solodov, “Error bounds for 2-regular mappings with Lipschitzian derivatives and their applications”, Math. Program., 89 (2001), 413–435.</mixed-citation><mixed-citation xml:lang="en">A. F. Izmailov, M. V. Solodov, “Error bounds for 2-regular mappings with Lipschitzian derivatives and their applications”, Math. Program., 89 (2001), 413–435.</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>
