IDEAS home Printed from https://ideas.repec.org/a/spr/mathme/v99y2024i1d10.1007_s00186-024-00859-y.html
   My bibliography  Save this article

A D.C. approximation approach for optimization with probabilistic constraints based on Chen–Harker–Kanzow–Smale smooth plus function

Author

Listed:
  • Yonghong Ren

    (Liaoning Normal University)

  • Yuchao Sun

    (Liaoning Normal University)

  • Dachen Li

    (Liaoning Normal University)

  • Fangfang Guo

    (Dalian University of Technology)

Abstract

Many important practical problems can be formulated as probabilistic constrained optimization problem (PCOP), which is challenging to solve since it is usually non-convex and non-smooth. Effective methods for (PCOP) mostly focus on approximation techniques. This paper aims at studying the D.C. (difference of two convex functions) approximation techniques. A D.C. approximation is explored to solve the probabilistic constrained optimization problem based on Chen–Harker–Kanzow–Smale (CHKS) smooth plus function. A smooth approximation to probabilistic constraint function is proposed and the corresponding D.C. approximation problem is established. It is proved that the approximation problem is equivalent to the original one under certain conditions. Sequential convex approximation (SCA) algorithm is implemented to solve the D.C. approximation problem. Sample average approximation method is applied to solve the convex subproblem. Numerical results suggest that D.C. approximation technique is effective for optimization with probabilistic constraints.

Suggested Citation

  • Yonghong Ren & Yuchao Sun & Dachen Li & Fangfang Guo, 2024. "A D.C. approximation approach for optimization with probabilistic constraints based on Chen–Harker–Kanzow–Smale smooth plus function," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 99(1), pages 179-203, April.
    • Handle: RePEc:spr:mathme:v:99:y:2024:i:1:d:10.1007_s00186-024-00859-y
    DOI: 10.1007/s00186-024-00859-y
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s00186-024-00859-y
    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/s00186-024-00859-y?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.

    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:mathme:v:99:y:2024:i:1:d:10.1007_s00186-024-00859-y. 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.

    We have no bibliographic references for this item. You can help adding them by using 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.