IDEAS home Printed from https://ideas.repec.org/a/spr/joptap/v129y2006i1d10.1007_s10957-006-9049-0.html
   My bibliography  Save this article

Global Convergence of a Robust Smoothing SQP Method for Semi-Infinite Programming

Author

Listed:
  • C. Ling

    (Zhejiang University of Finance and Economics)

  • L. Q. Qi

    (City University of Hong Kong, Kowloon Tong)

  • G. L. Zhou

    (Curtin University of Technology)

  • S. Y. Wu

    (National Cheng-Kung University)

Abstract

The semi-infinite programming (SIP) problem is a program with infinitely many constraints. It can be reformulated as a nonsmooth nonlinear programming problem with finite constraints by using an integral function. Due to the nondifferentiability of the integral function, gradient-based algorithms cannot be used to solve this nonsmooth nonlinear programming problem. To overcome this difficulty, we present a robust smoothing sequential quadratic programming (SQP) algorithm for solving the nonsmooth nonlinear programming problem. At each iteration of the algorthm, we need to solve only a quadratic program that is always feasible and solvable. The global convergence of the algorithm is established under mild conditions. Numerical results are given.

Suggested Citation

  • C. Ling & L. Q. Qi & G. L. Zhou & S. Y. Wu, 2006. "Global Convergence of a Robust Smoothing SQP Method for Semi-Infinite Programming," Journal of Optimization Theory and Applications, Springer, vol. 129(1), pages 147-164, April.
    • Handle: RePEc:spr:joptap:v:129:y:2006:i:1:d:10.1007_s10957-006-9049-0
    DOI: 10.1007/s10957-006-9049-0
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10957-006-9049-0
    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-006-9049-0?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. Dong-Hui Li & Liqun Qi & Judy Tam & Soon-Yi Wu, 2004. "A Smoothing Newton Method for Semi-Infinite Programming," Journal of Global Optimization, Springer, vol. 30(2), pages 169-194, November.
    2. K.L. Teo & X.Q. Yang & L.S. Jennings, 2000. "Computational Discretization Algorithms for Functional Inequality Constrained Optimization," Annals of Operations Research, Springer, vol. 98(1), pages 215-234, December.
    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. Xiaojiao Tong & Liqun Qi & Soon-Yi Wu & Felix Wu, 2012. "A smoothing SQP method for nonlinear programs with stability constraints arising from power systems," Computational Optimization and Applications, Springer, vol. 51(1), pages 175-197, January.
    2. 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.
    3. 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).
    4. Jiachen Ju & Qian Liu, 2020. "Convergence properties of a class of exact penalty methods for semi-infinite optimization problems," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 91(3), pages 383-403, June.
    5. Qian Liu & Changyu Wang & Xinmin Yang, 2013. "On the convergence of a smoothed penalty algorithm for semi-infinite programming," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 78(2), pages 203-220, October.

    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. Xiaojiao Tong & Soon-Yi Wu & Renjun Zhou, 2010. "New approach for the nonlinear programming with transient stability constraints arising from power systems," Computational Optimization and Applications, Springer, vol. 45(3), pages 495-520, April.
    2. 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.
    3. 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.
    4. 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.
    5. 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.
    6. 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.
    7. Dong-Hui Li & Liqun Qi & Judy Tam & Soon-Yi Wu, 2004. "A Smoothing Newton Method for Semi-Infinite Programming," Journal of Global Optimization, Springer, vol. 30(2), pages 169-194, November.
    8. Liping Zhang & Soon-Yi Wu, 2011. "A new approach to the weighted peak-constrained least-square error FIR digital filter optimal design problem," Computational Optimization and Applications, Springer, vol. 50(2), pages 445-461, October.
    9. S. Mishra & M. Jaiswal & H. Le Thi, 2012. "Nonsmooth semi-infinite programming problem using Limiting subdifferentials," Journal of Global Optimization, Springer, vol. 53(2), pages 285-296, June.
    10. Takayuki Okuno & Masao Fukushima, 2014. "Local reduction based SQP-type method for semi-infinite programs with an infinite number of second-order cone constraints," Journal of Global Optimization, Springer, vol. 60(1), pages 25-48, September.
    11. 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.
    12. Jiachen Ju & Qian Liu, 2020. "Convergence properties of a class of exact penalty methods for semi-infinite optimization problems," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 91(3), pages 383-403, June.
    13. Qian Liu & Changyu Wang & Xinmin Yang, 2013. "On the convergence of a smoothed penalty algorithm for semi-infinite programming," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 78(2), pages 203-220, October.
    14. Xiaojiao Tong & Chen Ling & Soon-Yi Wu & Liqun Qi, 2013. "Semi-infinite programming method for optimal power flow with transient stability and variable clearing time of faults," Journal of Global Optimization, Springer, vol. 55(4), pages 813-830, April.
    15. 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).
    16. Ting-Jang Shiu & Soon-Yi Wu, 2012. "Relaxed cutting plane method with convexification for solving nonlinear semi-infinite programming problems," Computational Optimization and Applications, Springer, vol. 53(1), pages 91-113, September.

    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:129:y:2006:i:1:d:10.1007_s10957-006-9049-0. 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.