IDEAS home Printed from https://ideas.repec.org/a/spr/joptap/v173y2017i3d10.1007_s10957-016-0998-7.html
   My bibliography  Save this article

Global Optimality Conditions in Nonconvex Optimization

Author

Listed:
  • Alexander S. Strekalovsky

    (Matrosov Institute for System Dynamics and Control Theory SB RAS)

Abstract

In this paper, we address the nonconvex optimization problem, with the goal function and the inequality constraints given by the functions represented by the difference of convex functions. The effectiveness of the classical Lagrange function and the max-merit function is being investigated as the merit functions of the original problem. In addition to the classical apparatus of optimization theory, we apply the new global optimality conditions for the auxiliary problems related to the Lagrange and max-merit functions.

Suggested Citation

  • Alexander S. Strekalovsky, 2017. "Global Optimality Conditions in Nonconvex Optimization," Journal of Optimization Theory and Applications, Springer, vol. 173(3), pages 770-792, June.
  • Handle: RePEc:spr:joptap:v:173:y:2017:i:3:d:10.1007_s10957-016-0998-7
    DOI: 10.1007/s10957-016-0998-7
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10957-016-0998-7
    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/s10957-016-0998-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. Strekalovsky, Alexander S., 2015. "On local search in d.c. optimization problems," Applied Mathematics and Computation, Elsevier, vol. 255(C), pages 73-83.
    2. Alexander S. Strekalovsky, 2013. "Global Optimality Conditions for Optimal Control Problems with Functions of A.D. Alexandrov," Journal of Optimization Theory and Applications, Springer, vol. 159(2), pages 297-321, November.
    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. M. V. Dolgopolik, 2020. "New global optimality conditions for nonsmooth DC optimization problems," Journal of Global Optimization, Springer, vol. 76(1), pages 25-55, January.
    2. Gruzdeva, Tatiana V. & Strekalovsky, Alexander S., 2018. "On solving the sum-of-ratios problem," Applied Mathematics and Computation, Elsevier, vol. 318(C), pages 260-269.

    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. S. Dempe & S. Franke, 2016. "On the solution of convex bilevel optimization problems," Computational Optimization and Applications, Springer, vol. 63(3), pages 685-703, April.
    2. M. V. Dolgopolik, 2020. "New global optimality conditions for nonsmooth DC optimization problems," Journal of Global Optimization, Springer, vol. 76(1), pages 25-55, January.
    3. Sinha, Ankur & Das, Arka & Anand, Guneshwar & Jayaswal, Sachin, 2023. "A general purpose exact solution method for mixed integer concave minimization problems," European Journal of Operational Research, Elsevier, vol. 309(3), pages 977-992.
    4. Sinha, Ankur & Das, Arka & Anand, Guneshwar & Jayaswal, Sachin, 2021. "A General Purpose Exact Solution Method for Mixed Integer Concave Minimization Problems," IIMA Working Papers WP 2021-03-01, Indian Institute of Management Ahmedabad, Research and Publication Department.
    5. Wim Ackooij & Welington Oliveira, 2019. "Nonsmooth and Nonconvex Optimization via Approximate Difference-of-Convex Decompositions," Journal of Optimization Theory and Applications, Springer, vol. 182(1), pages 49-80, July.
    6. Mikhail Posypkin & Oleg Khamisov, 2021. "Automatic Convexity Deduction for Efficient Function’s Range Bounding," Mathematics, MDPI, vol. 9(2), pages 1-16, January.
    7. Joki, Kaisa & Bagirov, Adil M. & Karmitsa, Napsu & Mäkelä, Marko M. & Taheri, Sona, 2020. "Clusterwise support vector linear regression," European Journal of Operational Research, Elsevier, vol. 287(1), pages 19-35.
    8. Sinha, Ankur & Das, Arka & Anand, Guneshwar & Jayaswal, Sachin, 2021. "A General Purpose Exact Solution Method for Mixed Integer Concave Minimization Problems (revised as on 12/08/2021)," IIMA Working Papers WP 2021-03-01, Indian Institute of Management Ahmedabad, Research and Publication Department.

    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:joptap:v:173:y:2017:i:3:d:10.1007_s10957-016-0998-7. 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.