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

Local Convergence Analysis of a Primal–Dual Method for Bound-Constrained Optimization Without SOSC

Author

Listed:
  • Paul Armand

    (Université de Limoges - Laboratoire XLIM)

  • Ngoc Nguyen Tran

    (Quy Nhon University)

Abstract

We propose a local convergence analysis of a primal–dual interior point algorithm for the solution of a bound-constrained optimization problem. The algorithm includes a regularization technique to prevent singularity of the matrix of the linear system at each iteration, when the second-order sufficient conditions do not hold at the solution. These conditions are replaced by a milder assumption related to a local error-bound condition. This new condition is a generalization of the one used in unconstrained optimization. We show that by an appropriate updating strategy of the barrier parameter and of the regularization parameter, the proposed algorithm owns a superlinear rate of convergence. The analysis is made thanks to a boundedness property of the inverse of the Jacobian matrix arising in interior point algorithms. An illustrative example is given to show the behavior and the gain obtained by this regularization strategy.

Suggested Citation

  • Paul Armand & Ngoc Nguyen Tran, 2021. "Local Convergence Analysis of a Primal–Dual Method for Bound-Constrained Optimization Without SOSC," Journal of Optimization Theory and Applications, Springer, vol. 189(1), pages 96-116, April.
  • Handle: RePEc:spr:joptap:v:189:y:2021:i:1:d:10.1007_s10957-021-01822-1
    DOI: 10.1007/s10957-021-01822-1
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10957-021-01822-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-021-01822-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. Paul Armand & Isaï Lankoandé, 2017. "An inexact proximal regularization method for unconstrained optimization," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 85(1), pages 43-59, February.
    2. Paul Armand & Joël Benoist & Jean-Pierre Dussault, 2012. "Local path-following property of inexact interior methods in nonlinear programming," Computational Optimization and Applications, Springer, vol. 52(1), pages 209-238, May.
    3. Hamid Esmaeili & Morteza Kimiaei, 2016. "A trust-region method with improved adaptive radius for systems of nonlinear equations," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 83(1), pages 109-125, February.
    4. Marc Fuentes & Jérôme Malick & Claude Lemaréchal, 2012. "Descentwise inexact proximal algorithms for smooth optimization," Computational Optimization and Applications, Springer, vol. 53(3), pages 755-769, December.
    5. Paul Armand & Riadh Omheni, 2017. "A Mixed Logarithmic Barrier-Augmented Lagrangian Method for Nonlinear Optimization," Journal of Optimization Theory and Applications, Springer, vol. 173(2), pages 523-547, May.
    6. Paul Tseng & Sangwoon Yun, 2014. "Incrementally Updated Gradient Methods for Constrained and Regularized Optimization," Journal of Optimization Theory and Applications, Springer, vol. 160(3), pages 832-853, March.
    7. Kenji Ueda & Nobuo Yamashita, 2014. "A regularized Newton method without line search for unconstrained optimization," Computational Optimization and Applications, Springer, vol. 59(1), pages 321-351, October.
    8. Ying-Jie Li & Dong-Hui Li, 2009. "Truncated regularized Newton method for convex minimizations," Computational Optimization and Applications, Springer, vol. 43(1), pages 119-131, May.
    9. Hamid Esmaeili & Morteza Kimiaei, 2016. "A trust-region method with improved adaptive radius for systems of nonlinear equations," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 83(1), pages 109-125, February.
    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. Paul Armand & Isaï Lankoandé, 2017. "An inexact proximal regularization method for unconstrained optimization," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 85(1), pages 43-59, February.
    2. Morteza Kimiaei & Farzad Rahpeymaii, 2019. "A new nonmonotone line-search trust-region approach for nonlinear systems," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 27(2), pages 199-232, July.
    3. Chuan He & Heng Huang & Zhaosong Lu, 2024. "A Newton-CG based barrier-augmented Lagrangian method for general nonconvex conic optimization," Computational Optimization and Applications, Springer, vol. 89(3), pages 843-894, December.
    4. Tran Ngoc Nguyen, 2025. "Convergence analysis of a mixed logarithmic barrier-augmented Lagrangian algorithm without constraint qualification," Computational Optimization and Applications, Springer, vol. 91(3), pages 1105-1134, July.
    5. Glaydston Carvalho Bento & João Xavier Cruz Neto & Antoine Soubeyran & Valdinês Leite Sousa Júnior, 2016. "Dual Descent Methods as Tension Reduction Systems," Journal of Optimization Theory and Applications, Springer, vol. 171(1), pages 209-227, October.
    6. Yamakawa, Yuya & Yamashita, Nobuo, 2025. "Convergence analysis of a regularized Newton method with generalized regularization terms for unconstrained convex optimization problems," Applied Mathematics and Computation, Elsevier, vol. 491(C).
    7. Benedetta Morini & Valeria Simoncini, 2017. "Stability and Accuracy of Inexact Interior Point Methods for Convex Quadratic Programming," Journal of Optimization Theory and Applications, Springer, vol. 175(2), pages 450-477, November.
    8. Simeon vom Dahl & Christian Kanzow, 2024. "An inexact regularized proximal Newton method without line search," Computational Optimization and Applications, Springer, vol. 89(3), pages 585-624, December.
    9. Franck Iutzeler & Jérôme Malick, 2018. "On the Proximal Gradient Algorithm with Alternated Inertia," Journal of Optimization Theory and Applications, Springer, vol. 176(3), pages 688-710, March.
    10. Sangho Kum & Sangwoon Yun, 2017. "Incremental Gradient Method for Karcher Mean on Symmetric Cones," Journal of Optimization Theory and Applications, Springer, vol. 172(1), pages 141-155, January.
    11. Nitish Das & P. Aruna Priya, 2019. "A Gradient-Based Interior-Point Method to Solve the Many-to-Many Assignment Problems," Complexity, Hindawi, vol. 2019, pages 1-13, July.
    12. Paul Armand & Ngoc Nguyen Tran, 2019. "An Augmented Lagrangian Method for Equality Constrained Optimization with Rapid Infeasibility Detection Capabilities," Journal of Optimization Theory and Applications, Springer, vol. 181(1), pages 197-215, April.
    13. David Ek & Anders Forsgren, 2023. "A structured modified Newton approach for solving systems of nonlinear equations arising in interior-point methods for quadratic programming," Computational Optimization and Applications, Springer, vol. 86(1), pages 1-48, September.
    14. Tuyen Trung Truong & Tat Dat To & Hang-Tuan Nguyen & Thu Hang Nguyen & Hoang Phuong Nguyen & Maged Helmy, 2023. "A Fast and Simple Modification of Newton’s Method Avoiding Saddle Points," Journal of Optimization Theory and Applications, Springer, vol. 199(2), pages 805-830, November.
    15. Jianyu Xiao & Haibin Zhang & Huan Gao, 2025. "A Chebyshev–Halley Method with Gradient Regularization and an Improved Convergence Rate," Mathematics, MDPI, vol. 13(8), pages 1-17, April.
    16. Kenji Ueda & Nobuo Yamashita, 2014. "A regularized Newton method without line search for unconstrained optimization," Computational Optimization and Applications, Springer, vol. 59(1), pages 321-351, October.
    17. Spyridon Pougkakiotis & Jacek Gondzio, 2021. "An interior point-proximal method of multipliers for convex quadratic programming," Computational Optimization and Applications, Springer, vol. 78(2), pages 307-351, March.
    18. Spyridon Pougkakiotis & Jacek Gondzio, 2019. "Dynamic Non-diagonal Regularization in Interior Point Methods for Linear and Convex Quadratic Programming," Journal of Optimization Theory and Applications, Springer, vol. 181(3), pages 905-945, June.
    19. Elizabeth Karas & Sandra Santos & Benar Svaiter, 2015. "Algebraic rules for quadratic regularization of Newton’s method," Computational Optimization and Applications, Springer, vol. 60(2), pages 343-376, March.
    20. Jacek Gondzio & Spyridon Pougkakiotis & John W. Pearson, 2022. "General-purpose preconditioning for regularized interior point methods," Computational Optimization and Applications, Springer, vol. 83(3), pages 727-757, December.

    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:189:y:2021:i:1:d:10.1007_s10957-021-01822-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.