IDEAS home Printed from https://ideas.repec.org/a/spr/jglopt/v30y2004i2p169-194.html
   My bibliography  Save this article

A Smoothing Newton Method for Semi-Infinite Programming

Author

Listed:
  • Dong-Hui Li
  • Liqun Qi
  • Judy Tam
  • Soon-Yi Wu

Abstract

No abstract is available for this item.

Suggested Citation

  • 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.
    • Handle: RePEc:spr:jglopt:v:30:y:2004:i:2:p:169-194
    DOI: 10.1007/s10898-004-8266-z
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/s10898-004-8266-z
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1007/s10898-004-8266-z?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. 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.
    2. Liqun Qi, 1999. "Regular Pseudo-Smooth NCP and BVIP Functions and Globally and Quadratically Convergent Generalized Newton Methods for Complementarity and Variational Inequality Problems," Mathematics of Operations Research, INFORMS, vol. 24(2), pages 440-471, May.
    3. Liqun Qi & Houyuan Jiang, 1997. "Semismooth Karush-Kuhn-Tucker Equations and Convergence Analysis of Newton and Quasi-Newton Methods for Solving these Equations," Mathematics of Operations Research, INFORMS, vol. 22(2), pages 301-325, May.
    4. Liqun Qi, 1993. "Convergence Analysis of Some Algorithms for Solving Nonsmooth Equations," Mathematics of Operations Research, INFORMS, vol. 18(1), pages 227-244, 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. 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.
    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. 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.
    4. 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.
    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. 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.
    7. 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.
    8. 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.
    9. 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.
    10. 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.
    11. 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).
    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. 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.

    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. Alain B. Zemkoho & Shenglong Zhou, 2021. "Theoretical and numerical comparison of the Karush–Kuhn–Tucker and value function reformulations in bilevel optimization," Computational Optimization and Applications, Springer, vol. 78(2), pages 625-674, March.
    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. 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.
    4. Shouqiang Du & Liyuan Cui & Yuanyuan Chen & Yimin Wei, 2022. "Stochastic Tensor Complementarity Problem with Discrete Distribution," Journal of Optimization Theory and Applications, Springer, vol. 192(3), pages 912-929, March.
    5. 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.
    6. L. W. Zhang & Z. Q. Xia, 2001. "Newton-Type Methods for Quasidifferentiable Equations," Journal of Optimization Theory and Applications, Springer, vol. 108(2), pages 439-456, February.
    7. Chen Ling & Hongxia Yin & Guanglu Zhou, 2011. "A smoothing Newton-type method for solving the L 2 spectral estimation problem with lower and upper bounds," Computational Optimization and Applications, Springer, vol. 50(2), pages 351-378, October.
    8. Z. Wei & L. Qi & X. Chen, 2003. "An SQP-Type Method and Its Application in Stochastic Programs," Journal of Optimization Theory and Applications, Springer, vol. 116(1), pages 205-228, January.
    9. John Duggan & Tasos Kalandrakis, 2011. "A Newton collocation method for solving dynamic bargaining games," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 36(3), pages 611-650, April.
    10. Liang Chen & Anping Liao, 2020. "On the Convergence Properties of a Second-Order Augmented Lagrangian Method for Nonlinear Programming Problems with Inequality Constraints," Journal of Optimization Theory and Applications, Springer, vol. 187(1), pages 248-265, October.
    11. H. Xu & B. M. Glover, 1997. "New Version of the Newton Method for Nonsmooth Equations," Journal of Optimization Theory and Applications, Springer, vol. 93(2), pages 395-415, May.
    12. Ralf Münnich & Ekkehard Sachs & Matthias Wagner, 2012. "Calibration of estimator-weights via semismooth Newton method," Journal of Global Optimization, Springer, vol. 52(3), pages 471-485, March.
    13. 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.
    14. Vasileios Kitsikoudis & Pierre Archambeau & Benjamin Dewals & Estanislao Pujades & Philippe Orban & Alain Dassargues & Michel Pirotton & Sebastien Erpicum, 2020. "Underground Pumped-Storage Hydropower (UPSH) at the Martelange Mine (Belgium): Underground Reservoir Hydraulics," Energies, MDPI, vol. 13(14), pages 1-16, July.
    15. Y. Gao, 2006. "Newton Methods for Quasidifferentiable Equations and Their Convergence," Journal of Optimization Theory and Applications, Springer, vol. 131(3), pages 417-428, December.
    16. 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.
    17. J. Han & D. Sun, 1997. "Newton and Quasi-Newton Methods for Normal Maps with Polyhedral Sets," Journal of Optimization Theory and Applications, Springer, vol. 94(3), pages 659-676, September.
    18. 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.
    19. G. L. Zhou & L. Caccetta, 2008. "Feasible Semismooth Newton Method for a Class of Stochastic Linear Complementarity Problems," Journal of Optimization Theory and Applications, Springer, vol. 139(2), pages 379-392, November.
    20. M. A. Tawhid & J. L. Goffin, 2008. "On Minimizing Some Merit Functions for Nonlinear Complementarity Problems under H-Differentiability," Journal of Optimization Theory and Applications, Springer, vol. 139(1), pages 127-140, October.

    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:jglopt:v:30:y:2004:i:2:p:169-194. 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.