IDEAS home Printed from https://ideas.repec.org/a/spr/coopap/v54y2013i3p595-617.html
   My bibliography  Save this article

An inexact restoration strategy for the globalization of the sSQP method

Author

Listed:
  • D. Fernández
  • E. Pilotta
  • G. Torres

Abstract

A globally convergent algorithm based on the stabilized sequential quadratic programming (sSQP) method is presented in order to solve optimization problems with equality constraints and bounds. This formulation has attractive features in the sense that constraint qualifications are not needed at all. In contrast with classic globalization strategies for Newton-like methods, we do not make use of merit functions. Our scheme is based on performing corrections on the solutions of the subproblems by using an inexact restoration procedure. The presented method is well defined and any accumulation point of the generated primal sequence is either a Karush-Kuhn-Tucker point or a stationary (maybe feasible) point of the problem of minimizing the infeasibility. Also, under suitable hypotheses, the sequence generated by the algorithm converges Q-linearly. Numerical experiments are given to confirm theoretical results. Copyright Springer Science+Business Media, LLC 2013

Suggested Citation

  • D. Fernández & E. Pilotta & G. Torres, 2013. "An inexact restoration strategy for the globalization of the sSQP method," Computational Optimization and Applications, Springer, vol. 54(3), pages 595-617, April.
    • Handle: RePEc:spr:coopap:v:54:y:2013:i:3:p:595-617
    DOI: 10.1007/s10589-012-9502-y
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/s10589-012-9502-y
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1007/s10589-012-9502-y?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. Andreas Fischer & Ana Friedlander, 2010. "A new line search inexact restoration approach for nonlinear programming," Computational Optimization and Applications, Springer, vol. 46(2), pages 333-346, June.
    2. Teemu Pennanen, 2002. "Local Convergence of the Proximal Point Algorithm and Multiplier Methods Without Monotonicity," Mathematics of Operations Research, INFORMS, vol. 27(1), pages 170-191, February.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. A. F. Izmailov & M. V. Solodov, 2015. "Newton-Type Methods: A Broader View," Journal of Optimization Theory and Applications, Springer, vol. 164(2), pages 577-620, February.
    2. A. F. Izmailov & M. V. Solodov & E. I. Uskov, 2019. "A globally convergent Levenberg–Marquardt method for equality-constrained optimization," Computational Optimization and Applications, Springer, vol. 72(1), pages 215-239, January.
    3. A. Izmailov & M. Solodov, 2015. "Critical Lagrange multipliers: what we currently know about them, how they spoil our lives, and what we can do about it," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 23(1), pages 1-26, April.
    4. A. Izmailov & M. Solodov & E. Uskov, 2015. "Combining stabilized SQP with the augmented Lagrangian algorithm," Computational Optimization and Applications, Springer, vol. 62(2), pages 405-429, November.
    5. Songqiang Qiu, 2019. "Convergence of a stabilized SQP method for equality constrained optimization," Computational Optimization and Applications, Springer, vol. 73(3), pages 957-996, July.
    6. A. F. Izmailov & E. I. Uskov, 2017. "Subspace-stabilized sequential quadratic programming," Computational Optimization and Applications, Springer, vol. 67(1), pages 129-154, May.
    7. A. F. Izmailov & M. V. Solodov & E. I. Uskov, 2016. "Globalizing Stabilized Sequential Quadratic Programming Method by Smooth Primal-Dual Exact Penalty Function," Journal of Optimization Theory and Applications, Springer, vol. 169(1), pages 148-178, April.
    8. Daniel Robinson, 2015. "Comments on: Critical Lagrange multipliers: what we currently know about them, how they spoil our lives, and what we can do about it," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 23(1), pages 43-47, April.

    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. Roberto Andreani & José Mario Martínez & Alberto Ramos & Paulo J. S. Silva, 2018. "Strict Constraint Qualifications and Sequential Optimality Conditions for Constrained Optimization," Mathematics of Operations Research, INFORMS, vol. 43(3), pages 693-717, August.
    2. L. F. Bueno & G. Haeser & J. M. Martínez, 2015. "A Flexible Inexact-Restoration Method for Constrained Optimization," Journal of Optimization Theory and Applications, Springer, vol. 165(1), pages 188-208, April.
    3. Paul Tseng, 2004. "An Analysis of the EM Algorithm and Entropy-Like Proximal Point Methods," Mathematics of Operations Research, INFORMS, vol. 29(1), pages 27-44, February.
    4. D. Russell Luke & Nguyen H. Thao & Matthew K. Tam, 2018. "Quantitative Convergence Analysis of Iterated Expansive, Set-Valued Mappings," Mathematics of Operations Research, INFORMS, vol. 43(4), pages 1143-1176, November.
    5. Jonathan Eckstein & Paulo Silva, 2010. "Proximal methods for nonlinear programming: double regularization and inexact subproblems," Computational Optimization and Applications, Springer, vol. 46(2), pages 279-304, June.
    6. Y. D. Dong & A. Fischer, 2006. "A Framework for Analyzing Local Convergence Properties with Applications to Proximal-Point Algorithms," Journal of Optimization Theory and Applications, Springer, vol. 131(1), pages 53-68, October.
    7. Rocha, Rogério Azevedo & Oliveira, Paulo Roberto & Gregório, Ronaldo Malheiros & Souza, Michael, 2016. "Logarithmic quasi-distance proximal point scalarization method for multi-objective programming," Applied Mathematics and Computation, Elsevier, vol. 273(C), pages 856-867.
    8. E. G. Birgin & L. F. Bueno & J. M. Martínez, 2016. "Sequential equality-constrained optimization for nonlinear programming," Computational Optimization and Applications, Springer, vol. 65(3), pages 699-721, December.
    9. Glaydston de C. Bento & João Xavier Cruz Neto & Lucas V. Meireles, 2018. "Proximal Point Method for Locally Lipschitz Functions in Multiobjective Optimization of Hadamard Manifolds," Journal of Optimization Theory and Applications, Springer, vol. 179(1), pages 37-52, October.
    10. Andreas Fischer, 2015. "Comments on: Critical Lagrange multipliers: what we currently know about them, how they spoil our lives, and what we can do about it," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 23(1), pages 27-31, April.
    11. Nahid Banihashemi & C. Yalçın Kaya, 2013. "Inexact Restoration for Euler Discretization of Box-Constrained Optimal Control Problems," Journal of Optimization Theory and Applications, Springer, vol. 156(3), pages 726-760, March.
    12. F. Lara, 2022. "On Strongly Quasiconvex Functions: Existence Results and Proximal Point Algorithms," Journal of Optimization Theory and Applications, Springer, vol. 192(3), pages 891-911, March.
    13. Yunda Dong, 2021. "Weak convergence of an extended splitting method for monotone inclusions," Journal of Global Optimization, Springer, vol. 79(1), pages 257-277, January.
    14. Sorin-Mihai Grad & Felipe Lara, 2022. "An extension of the proximal point algorithm beyond convexity," Journal of Global Optimization, Springer, vol. 82(2), pages 313-329, February.
    15. A. F. Izmailov & M. V. Solodov, 2015. "Newton-Type Methods: A Broader View," Journal of Optimization Theory and Applications, Springer, vol. 164(2), pages 577-620, February.
    16. Francisco Aragón Artacho & Michaël Gaydu, 2012. "A Lyusternik–Graves theorem for the proximal point method," Computational Optimization and Applications, Springer, vol. 52(3), pages 785-803, July.
    17. Glaydston Carvalho Bento & João Xavier Cruz Neto & Paulo Roberto Oliveira, 2016. "A New Approach to the Proximal Point Method: Convergence on General Riemannian Manifolds," Journal of Optimization Theory and Applications, Springer, vol. 168(3), pages 743-755, March.
    18. Juliano B. Francisco & Douglas S. Gonçalves & Fermín S. V. Bazán & Lila L. T. Paredes, 2020. "Non-monotone inexact restoration method for nonlinear programming," Computational Optimization and Applications, Springer, vol. 76(3), pages 867-888, July.
    19. Yunda Dong, 2014. "The Proximal Point Algorithm Revisited," Journal of Optimization Theory and Applications, Springer, vol. 161(2), pages 478-489, May.
    20. Papa Quiroz, E.A. & Mallma Ramirez, L. & Oliveira, P.R., 2015. "An inexact proximal method for quasiconvex minimization," European Journal of Operational Research, Elsevier, vol. 246(3), pages 721-729.

    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:coopap:v:54:y:2013:i:3:p:595-617. 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.