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

Smoothing SQP algorithm for semismooth equations with box constraints

Author

Listed:
  • Changyu Wang
  • Qian Liu
  • Cheng Ma

Abstract

In this paper, in order to solve semismooth equations with box constraints, we present a class of smoothing SQP algorithms using the regularized-smooth techniques. The main difference of our algorithm from some related literature is that the correspondent objective function arising from the equation system is not required to be continuously differentiable. Under the appropriate conditions, we prove the global convergence theorem, in other words, any accumulation point of the iteration point sequence generated by the proposed algorithm is a KKT point of the corresponding optimization problem with box constraints. Particularly, if an accumulation point of the iteration sequence is a vertex of box constraints and additionally, its corresponding KKT multipliers satisfy strictly complementary conditions, the gradient projection of the iteration sequence finitely terminates at this vertex. Furthermore, under local error bound conditions which are weaker than BD-regular conditions, we show that the proposed algorithm converges superlinearly. Finally, the promising numerical results demonstrate that the proposed smoothing SQP algorithm is an effective method. Copyright Springer Science+Business Media New York 2013

Suggested Citation

  • Changyu Wang & Qian Liu & Cheng Ma, 2013. "Smoothing SQP algorithm for semismooth equations with box constraints," Computational Optimization and Applications, Springer, vol. 55(2), pages 399-425, June.
    • Handle: RePEc:spr:coopap:v:55:y:2013:i:2:p:399-425
    DOI: 10.1007/s10589-012-9524-5
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/s10589-012-9524-5
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1007/s10589-012-9524-5?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. N.H. Xiu & J.Z. Zhang, 2002. "Local Convergence Analysis of Projection-Type Algorithms: Unified Approach," Journal of Optimization Theory and Applications, Springer, vol. 115(1), pages 211-230, October.
    2. Chen Ling & Qin Ni & Liqun Qi & Soon-Yi Wu, 2010. "A new smoothing Newton-type algorithm for semi-infinite programming," Journal of Global Optimization, Springer, vol. 47(1), pages 133-159, May.
    3. L. Qi & X. J. Tong & D. H. Li, 2004. "Active-Set Projected Trust-Region Algorithm for Box-Constrained Nonsmooth Equations," Journal of Optimization Theory and Applications, Springer, vol. 120(3), pages 601-625, March.
    4. Dong-Hui Li & Masao Fukushima, 2001. "Globally Convergent Broyden-Like Methods for Semismooth Equations and Applications to VIP, NCP and MCP," Annals of Operations Research, Springer, vol. 103(1), pages 71-97, March.
    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. Ma, Cheng & Zhang, Liansheng, 2015. "On an exact penalty function method for nonlinear mixed discrete programming problems and its applications in search engine advertising problems," Applied Mathematics and Computation, Elsevier, vol. 271(C), pages 642-656.
    2. Biao Qu & Changyu Wang & Naihua Xiu, 2017. "Analysis on Newton projection method for the split feasibility problem," Computational Optimization and Applications, Springer, vol. 67(1), pages 175-199, May.

    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. Sanja Rapajić & Zoltan Papp, 2017. "A nonmonotone Jacobian smoothing inexact Newton method for NCP," Computational Optimization and Applications, Springer, vol. 66(3), pages 507-532, April.
    2. J. Chen & L. Qi, 2010. "Pseudotransient Continuation for Solving Systems of Nonsmooth Equations with Inequality Constraints," Journal of Optimization Theory and Applications, Springer, vol. 147(2), pages 223-242, November.
    3. R. U. Verma, 2004. "Generalized System for Relaxed Cocoercive Variational Inequalities and Projection Methods," Journal of Optimization Theory and Applications, Springer, vol. 121(1), pages 203-210, April.
    4. Gonglin Yuan & Zengxin Wei & Zhongxing Wang, 2013. "Gradient trust region algorithm with limited memory BFGS update for nonsmooth convex minimization," Computational Optimization and Applications, Springer, vol. 54(1), pages 45-64, January.
    5. Li-Ping Pang & Jian Lv & Jin-He Wang, 2016. "Constrained incremental bundle method with partial inexact oracle for nonsmooth convex semi-infinite programming problems," Computational Optimization and Applications, Springer, vol. 64(2), pages 433-465, June.
    6. Jiao Li & Yu-Fei Yang & Bo Yu, 2012. "A nonmonotone PSB algorithm for solving unconstrained optimization," Computational Optimization and Applications, Springer, vol. 52(1), pages 267-280, May.
    7. Shin-ya Matsushita & Li Xu, 2014. "On Finite Convergence of Iterative Methods for Variational Inequalities in Hilbert Spaces," Journal of Optimization Theory and Applications, Springer, vol. 161(3), pages 701-715, June.
    8. Leonardo Galli & Christian Kanzow & Marco Sciandrone, 2018. "A nonmonotone trust-region method for generalized Nash equilibrium and related problems with strong convergence properties," Computational Optimization and Applications, Springer, vol. 69(3), pages 629-652, April.
    9. Li, Xiangli & Guo, Xiao, 2015. "Spectral residual methods with two new non-monotone line searches for large-scale nonlinear systems of equations," Applied Mathematics and Computation, Elsevier, vol. 269(C), pages 59-69.
    10. Jingyong Tang & Jinchuan Zhou, 2021. "A smoothing quasi-Newton method for solving general second-order cone complementarity problems," Journal of Global Optimization, Springer, vol. 80(2), pages 415-438, June.
    11. X. J. Tong & L. Qi, 2004. "On the Convergence of a Trust-Region Method for Solving Constrained Nonlinear Equations with Degenerate Solutions," Journal of Optimization Theory and Applications, Springer, vol. 123(1), pages 187-211, October.
    12. Bo Wei & William B. Haskell & Sixiang Zhao, 2020. "An inexact primal-dual algorithm for semi-infinite programming," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 91(3), pages 501-544, June.
    13. Mengwei Xu & Soon-Yi Wu & Jane Ye, 2014. "Solving semi-infinite programs by smoothing projected gradient method," Computational Optimization and Applications, Springer, vol. 59(3), pages 591-616, December.
    14. Biao Qu & Changyu Wang & Naihua Xiu, 2017. "Analysis on Newton projection method for the split feasibility problem," Computational Optimization and Applications, Springer, vol. 67(1), pages 175-199, May.
    15. Ping Jin & Chen Ling & Huifei Shen, 2015. "A smoothing Levenberg–Marquardt algorithm for semi-infinite programming," Computational Optimization and Applications, Springer, vol. 60(3), pages 675-695, April.
    16. Thinh, Vo Duc & Chuong, Thai Doan & Le Hoang Anh, Nguyen, 2023. "Formulas of first-ordered and second-ordered generalization differentials for convex robust systems with applications," Applied Mathematics and Computation, Elsevier, vol. 455(C).
    17. Bo Wei & William B. Haskell & Sixiang Zhao, 2020. "The CoMirror algorithm with random constraint sampling for convex semi-infinite programming," Annals of Operations Research, Springer, vol. 295(2), pages 809-841, December.
    18. Xuebin Wang & Changfeng Ma & Meiyan Li, 2011. "A globally and superlinearly convergent quasi-Newton method for general box constrained variational inequalities without smoothing approximation," Journal of Global Optimization, Springer, vol. 50(4), pages 675-694, August.
    19. Jingyong Tang & Jinchuan Zhou & Zhongfeng Sun, 2023. "A derivative-free line search technique for Broyden-like method with applications to NCP, wLCP and SI," Annals of Operations Research, Springer, vol. 321(1), pages 541-564, February.

    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:55:y:2013:i:2:p:399-425. 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.