IDEAS home Printed from https://ideas.repec.org/a/spr/joptap/v204y2025i2d10.1007_s10957-024-02568-2.html
   My bibliography  Save this article

Almost-Sure Convergence of Iterates and Multipliers in Stochastic Sequential Quadratic Optimization

Author

Listed:
  • Frank E. Curtis

    (Lehigh University)

  • Xin Jiang

    (Lehigh University)

  • Qi Wang

    (Lehigh University)

Abstract

Stochastic sequential quadratic optimization (SQP) methods for solving continuous optimization problems with nonlinear equality constraints have attracted attention recently, such as for solving large-scale data-fitting problems subject to nonconvex constraints. However, for a recently proposed subclass of such methods that is built on the popular stochastic-gradient methodology from the unconstrained setting, convergence guarantees have been limited to the asymptotic convergence of the expected value of a stationarity measure to zero. This is in contrast to the unconstrained setting in which almost-sure convergence guarantees (of the gradient of the objective to zero) can be proved for stochastic-gradient-based methods. In this paper, new almost-sure convergence guarantees for the primal iterates, Lagrange multipliers, and stationarity measures generated by a stochastic SQP algorithm in this subclass of methods are proved. It is shown that the error in the Lagrange multipliers can be bounded by the distance of the primal iterate to a primal stationary point plus the error in the latest stochastic gradient estimate. It is further shown that, subject to certain assumptions, this latter error can be made to vanish by employing a running average of the Lagrange multipliers that are computed during the run of the algorithm. The results of numerical experiments are provided to demonstrate the proved theoretical guarantees.

Suggested Citation

  • Frank E. Curtis & Xin Jiang & Qi Wang, 2025. "Almost-Sure Convergence of Iterates and Multipliers in Stochastic Sequential Quadratic Optimization," Journal of Optimization Theory and Applications, Springer, vol. 204(2), pages 1-30, February.
    • Handle: RePEc:spr:joptap:v:204:y:2025:i:2:d:10.1007_s10957-024-02568-2
    DOI: 10.1007/s10957-024-02568-2
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10957-024-02568-2
    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-024-02568-2?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. Xin Jiang & Lieven Vandenberghe, 2023. "Bregman Three-Operator Splitting Methods," Journal of Optimization Theory and Applications, Springer, vol. 196(3), pages 936-972, March.
    2. Albert S. Berahas & Jiahao Shi & Zihong Yi & Baoyu Zhou, 2023. "Accelerating stochastic sequential quadratic programming for equality constrained optimization using predictive variance reduction," Computational Optimization and Applications, Springer, vol. 86(1), pages 79-116, September.
    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.

      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:204:y:2025:i:2:d:10.1007_s10957-024-02568-2. 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.