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

Convergence of a class of penalty methods for constrained scalar set-valued optimization

Author

Listed:
  • X. Huang

Abstract

In this paper, we study a class of penalty methods for a class of constrained scalar set-valued optimization problems. We establish an equivalence relation between the lower semicontinuity at the origin of the optimal value function of the perturbed problem and the convergence of the penalty methods. Some sufficient conditions that guarantee the convergence of the penalty methods are also derived. Copyright Springer Science+Business Media, LLC. 2013

Suggested Citation

  • X. Huang, 2013. "Convergence of a class of penalty methods for constrained scalar set-valued optimization," Journal of Global Optimization, Springer, vol. 56(4), pages 1501-1513, August.
    • Handle: RePEc:spr:jglopt:v:56:y:2013:i:4:p:1501-1513
    DOI: 10.1007/s10898-012-9910-7
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/s10898-012-9910-7
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1007/s10898-012-9910-7?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, 2012. "Calmness and Exact Penalization in Constrained Scalar Set-Valued Optimization," Journal of Optimization Theory and Applications, Springer, vol. 154(1), pages 108-119, July.
    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. Marius Durea & Radu Strugariu, 2020. "On the sensitivity of Pareto efficiency in set-valued optimization problems," Journal of Global Optimization, Springer, vol. 78(3), pages 581-596, November.

    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:jglopt:v:56:y:2013:i:4:p:1501-1513. 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.