IDEAS home Printed from https://ideas.repec.org/a/spr/joptap/v203y2024i2d10.1007_s10957-023-02367-1.html
   My bibliography  Save this article

On Local Behavior of Newton-Type Methods Near Critical Solutions of Constrained Equations

Author

Listed:
  • A. F. Izmailov

    (Lomonosov Moscow State University
    Derzhavin Tambov State University (TSU))

  • M. V. Solodov

    (IMPA – Instituto de Matemática Pura e Aplicada, Estrada Dona Castorina 110, Jardim Botânico)

Abstract

For constrained equations with nonisolated solutions and a certain family of Newton-type methods, it was previously shown that if the equation mapping is 2-regular at a given solution with respect to a direction which is interior feasible and which is in the null space of the Jacobian, then there is an associated large (not asymptotically thin) domain of starting points from which the iterates are well defined and converge to the specific solution in question. Under these assumptions, the constrained local Lipschitzian error bound does not hold, unlike the common settings of convergence and rate of convergence analyses. In this work, we complement those previous results by considering the case when the equation mapping is 2-regular with respect to a direction in the null space of the Jacobian which is in the tangent cone to the set, but need not be interior feasible. Under some further conditions, we still show linear convergence of order 1/2 from a large domain around the solution (despite degeneracy, and despite that there may exist other solutions nearby). Our results apply to constrained variants of the Gauss–Newton and Levenberg–Marquardt methods, and to the LP-Newton method. An illustration for a smooth constrained reformulation of the nonlinear complementarity problem is also provided.

Suggested Citation

  • A. F. Izmailov & M. V. Solodov, 2024. "On Local Behavior of Newton-Type Methods Near Critical Solutions of Constrained Equations," Journal of Optimization Theory and Applications, Springer, vol. 203(2), pages 1103-1126, November.
    • Handle: RePEc:spr:joptap:v:203:y:2024:i:2:d:10.1007_s10957-023-02367-1
    DOI: 10.1007/s10957-023-02367-1
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10957-023-02367-1
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10957-023-02367-1?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. A. F. Izmailov & M. V. Solodov, 2002. "The Theory of 2-Regularity for Mappings with Lipschitzian Derivatives and its Applications to Optimality Conditions," Mathematics of Operations Research, INFORMS, vol. 27(3), pages 614-635, August.
    2. Marguerite Frank & Philip Wolfe, 1956. "An algorithm for quadratic programming," Naval Research Logistics Quarterly, John Wiley & Sons, vol. 3(1‐2), pages 95-110, March.
    3. A. Fischer & A. F. Izmailov & M. Jelitte, 2021. "Newton-type methods near critical solutions of piecewise smooth nonlinear equations," Computational Optimization and Applications, Springer, vol. 80(2), pages 587-615, November.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Andreas Fischer & Alexey F. Izmailov & Mario Jelitte, 2023. "Stability of Singular Solutions of Nonlinear Equations with Restricted Smoothness Assumptions," Journal of Optimization Theory and Applications, Springer, vol. 196(3), pages 1008-1035, March.
    2. Guillaume Sagnol & Edouard Pauwels, 2019. "An unexpected connection between Bayes A-optimal designs and the group lasso," Statistical Papers, Springer, vol. 60(2), pages 565-584, April.
    3. Abdelfettah Laouzai & Rachid Ouafi, 2022. "A prediction model for atmospheric pollution reduction from urban traffic," Environment and Planning B, , vol. 49(2), pages 566-584, February.
    4. Chou, Chang-Chi & Chiang, Wen-Chu & Chen, Albert Y., 2022. "Emergency medical response in mass casualty incidents considering the traffic congestions in proximity on-site and hospital delays," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 158(C).
    5. Francesco Rinaldi & Damiano Zeffiro, 2023. "Avoiding bad steps in Frank-Wolfe variants," Computational Optimization and Applications, Springer, vol. 84(1), pages 225-264, January.
    6. Beck, Yasmine & Ljubić, Ivana & Schmidt, Martin, 2023. "A survey on bilevel optimization under uncertainty," European Journal of Operational Research, Elsevier, vol. 311(2), pages 401-426.
    7. Friesz, Terry L. & Tourreilles, Francisco A. & Han, Anthony Fu-Wha, 1979. "Multi-Criteria Optimization Methods in Transport Project Evaluation: The Case of Rural Roads in Developing Countries," Transportation Research Forum Proceedings 1970s 318817, Transportation Research Forum.
    8. Fabiana R. Oliveira & Orizon P. Ferreira & Gilson N. Silva, 2019. "Newton’s method with feasible inexact projections for solving constrained generalized equations," Computational Optimization and Applications, Springer, vol. 72(1), pages 159-177, January.
    9. Ali Fattahi & Sriram Dasu & Reza Ahmadi, 2019. "Mass Customization and “Forecasting Options’ Penetration Rates Problem”," Operations Research, INFORMS, vol. 67(4), pages 1120-1134, July.
    10. Bo Jiang & Tianyi Lin & Shiqian Ma & Shuzhong Zhang, 2019. "Structured nonconvex and nonsmooth optimization: algorithms and iteration complexity analysis," Computational Optimization and Applications, Springer, vol. 72(1), pages 115-157, January.
    11. James Chok & Geoffrey M. Vasil, 2023. "Convex optimization over a probability simplex," Papers 2305.09046, arXiv.org.
    12. A. de Palma & Y. Nesterov, 2001. "Stationary Dynamic Solutions in Congested Transportation Networks: Summary and Perspectives," THEMA Working Papers 2001-19, THEMA (THéorie Economique, Modélisation et Applications), Université de Cergy-Pontoise.
    13. Andreas Fischer & Alexey F. Izmailov & Mario Jelitte, 2024. "Behavior of Newton-Type Methods Near Critical Solutions of Nonlinear Equations with Semismooth Derivatives," Journal of Optimization Theory and Applications, Springer, vol. 203(3), pages 2179-2205, December.
    14. D. J. White, 1993. "A parametric‐based heuristic program for the quadratic assignment problem," Naval Research Logistics (NRL), John Wiley & Sons, vol. 40(4), pages 553-568, June.
    15. A. Izmailov & M. Solodov, 2009. "Examples of dual behaviour of Newton-type methods on optimization problems with degenerate constraints," Computational Optimization and Applications, Springer, vol. 42(2), pages 231-264, March.
    16. Kang, Seong-Cheol & Lee, Hoyoung, 2019. "Economic appraisal of implementing electric vehicle taxis in Seoul," Research in Transportation Economics, Elsevier, vol. 73(C), pages 45-52.
    17. Michael W. Levin & Melissa Duell & S. Travis Waller, 2020. "Arrival Time Reliability in Strategic User Equilibrium," Networks and Spatial Economics, Springer, vol. 20(3), pages 803-831, September.
    18. Yong Xia & Zi Xu, 2010. "An efficient Lagrangian smoothing heuristic for Max-Cut," Indian Journal of Pure and Applied Mathematics, Springer, vol. 41(5), pages 683-700, October.
    19. Arezou Rahimi & Luis A. Vale-Silva & Maria Fälth Savitski & Jovan Tanevski & Julio Saez-Rodriguez, 2024. "DOT: a flexible multi-objective optimization framework for transferring features across single-cell and spatial omics," Nature Communications, Nature, vol. 15(1), pages 1-15, December.
    20. P. B. Assunção & O. P. Ferreira & L. F. Prudente, 2021. "Conditional gradient method for multiobjective optimization," Computational Optimization and Applications, Springer, vol. 78(3), pages 741-768, April.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:joptap:v:203:y:2024:i:2:d:10.1007_s10957-023-02367-1. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.