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

A second-order smooth penalty function algorithm for constrained optimization problems

Author

Listed:
  • Xinsheng Xu
  • Zhiqing Meng
  • Jianwu Sun
  • Liguo Huang
  • Rui Shen

Abstract

This paper introduces a second-order differentiability smoothing technique to the classical l 1 exact penalty function for constrained optimization problems(COP). Error estimations among the optimal objective values of the nonsmooth penalty problem, the smoothed penalty problem and the original optimization problem are obtained. Based on the smoothed problem, an algorithm for solving COP is proposed and some preliminary numerical results indicate that the algorithm is quite promising. Copyright Springer Science+Business Media, LLC 2013

Suggested Citation

  • Xinsheng Xu & Zhiqing Meng & Jianwu Sun & Liguo Huang & Rui Shen, 2013. "A second-order smooth penalty function algorithm for constrained optimization problems," Computational Optimization and Applications, Springer, vol. 55(1), pages 155-172, May.
    • Handle: RePEc:spr:coopap:v:55:y:2013:i:1:p:155-172
    DOI: 10.1007/s10589-012-9504-9
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/s10589-012-9504-9
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1007/s10589-012-9504-9?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. X. X. Huang & X. Q. Yang, 2001. "Duality and Exact Penalization for Vector Optimization via Augmented Lagrangian," Journal of Optimization Theory and Applications, Springer, vol. 111(3), pages 615-640, December.
    2. Lasserre, J. B., 1981. "A globally convergent algorithm for exact penalty functions," European Journal of Operational Research, Elsevier, vol. 7(4), pages 389-395, August.
    3. Israel Zang, 1981. "Discontinuous Optimization by Smoothing," Mathematics of Operations Research, INFORMS, vol. 6(1), pages 140-152, 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. Duan Yaqiong & Lian Shujun, 2016. "Smoothing Approximation to the Square-Root Exact Penalty Function," Journal of Systems Science and Information, De Gruyter, vol. 4(1), pages 87-96, February.

    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. A. Y. Azimov, 2008. "Duality for Set-Valued Multiobjective Optimization Problems, Part 1: Mathematical Programming," Journal of Optimization Theory and Applications, Springer, vol. 137(1), pages 61-74, April.
    2. Bjarne Grimstad & Brage R. Knudsen, 2020. "Mathematical programming formulations for piecewise polynomial functions," Journal of Global Optimization, Springer, vol. 77(3), pages 455-486, July.
    3. X. X. Huang & X. Q. Yang, 2004. "Duality for Multiobjective Optimization via Nonlinear Lagrangian Functions," Journal of Optimization Theory and Applications, Springer, vol. 120(1), pages 111-127, January.
    4. X. X. Huang & X. Q. Yang, 2003. "A Unified Augmented Lagrangian Approach to Duality and Exact Penalization," Mathematics of Operations Research, INFORMS, vol. 28(3), pages 533-552, August.
    5. Dan Trietsch, 1985. "Optimal Motion Towards a Stochastic Destination," Discussion Papers 654, Northwestern University, Center for Mathematical Studies in Economics and Management Science.
    6. Achim Wechsung & Paul Barton, 2014. "Global optimization of bounded factorable functions with discontinuities," Journal of Global Optimization, Springer, vol. 58(1), pages 1-30, January.
    7. Zenios, Stavros A. & Pinar, Mustafa C. & Dembo, Ron S., 1995. "A smooth penalty function algorithm for network-structured problems," European Journal of Operational Research, Elsevier, vol. 83(1), pages 220-236, May.

    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:1:p:155-172. 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.