IDEAS home Printed from https://ideas.repec.org/a/spr/jglopt/v77y2020i1d10.1007_s10898-019-00849-z.html
   My bibliography  Save this article

Optimality conditions for convex problems on intersections of non necessarily convex sets

Author

Listed:
  • E. Allevi

    (Università degli Studi di Brescia)

  • J. E. Martínez-Legaz

    (Universitat Autònoma de Barcelona
    BGSMath)

  • R. Riccardi

    (Università degli Studi di Brescia)

Abstract

We present necessary and sufficient optimality conditions for the minimization of pseudoconvex functions over convex intersections of non necessarily convex sets. To this aim, we use the notion of local normal cone to a closed set at a point, due to Linh and Penot (SIAM J Optim 17:500–510, 2006). The technique we use to obtain the optimality conditions is based on the so called canonical representation of a closed set by means of its associated oriented distance function.

Suggested Citation

  • E. Allevi & J. E. Martínez-Legaz & R. Riccardi, 2020. "Optimality conditions for convex problems on intersections of non necessarily convex sets," Journal of Global Optimization, Springer, vol. 77(1), pages 143-155, May.
    • Handle: RePEc:spr:jglopt:v:77:y:2020:i:1:d:10.1007_s10898-019-00849-z
    DOI: 10.1007/s10898-019-00849-z
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10898-019-00849-z
    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/s10898-019-00849-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. Alireza Kabgani & Majid Soleimani-damaneh & Moslem Zamani, 2017. "Optimality conditions in optimization problems with convex feasible set using convexificators," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 86(1), pages 103-121, August.
    Full references (including those not matched with items on IDEAS)

    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. Felipe Serrano & Robert Schwarz & Ambros Gleixner, 2020. "On the relation between the extended supporting hyperplane algorithm and Kelley’s cutting plane algorithm," Journal of Global Optimization, Springer, vol. 78(1), pages 161-179, September.
    2. A. Kabgani & F. Lara, 2022. "Strong subdifferentials: theory and applications in nonconvex optimization," Journal of Global Optimization, Springer, vol. 84(2), pages 349-368, October.
    3. Kabgani, Alireza & Soleimani-damaneh, Majid, 2022. "Semi-quasidifferentiability in nonsmooth nonconvex multiobjective optimization," European Journal of Operational Research, Elsevier, vol. 299(1), pages 35-45.
    4. Felipe Lara & Alireza Kabgani, 2021. "On global subdifferentials with applications in nonsmooth optimization," Journal of Global Optimization, Springer, vol. 81(4), pages 881-900, December.

    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:77:y:2020:i:1:d:10.1007_s10898-019-00849-z. 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.