IDEAS home Printed from https://ideas.repec.org/a/gam/jmathe/v9y2021i13p1551-d586977.html
   My bibliography  Save this article

Trust-Region Based Penalty Barrier Algorithm for Constrained Nonlinear Programming Problems: An Application of Design of Minimum Cost Canal Sections

Author

Listed:
  • Bothina El-Sobky

    (Department of Mathematics and Computer Science, Faculty of Science, Alexandria University, Qism Bab Sharqi 21568, Egypt)

  • Yousria Abo-Elnaga

    (Department of Basic Science, Higher Technological Institute, Tenth of Ramadan City 44629, Egypt)

  • Abd Allah A. Mousa

    (Department of Mathematics and Statistics, College of Science, Taif University, P.O. Box 11099, Taif 21944, Saudi Arabia)

  • Mohamed A. El-Shorbagy

    (Department of Mathematics, College of Science and Humanities in Al-Kharj, Prince Sattam Bin Abdulaziz University, Al-Kharj 11942, Saudi Arabia
    Department of Basic Engineering Science, Faculty of Engineering, Menofia University, Shebin El-Kom 32511, Egypt)

Abstract

In this paper, a penalty method is used together with a barrier method to transform a constrained nonlinear programming problem into an unconstrained nonlinear programming problem. In the proposed approach, Newton’s method is applied to the barrier Karush–Kuhn–Tucker conditions. To ensure global convergence from any starting point, a trust-region globalization strategy is used. A global convergence theory of the penalty–barrier trust-region (PBTR) algorithm is studied under four standard assumptions. The PBTR has new features; it is simpler, has rapid convergerce, and is easy to implement. Numerical simulation was performed on some benchmark problems. The proposed algorithm was implemented to find the optimal design of a canal section for minimum water loss for a triangle cross-section application. The results are promising when compared with well-known algorithms.

Suggested Citation

  • Bothina El-Sobky & Yousria Abo-Elnaga & Abd Allah A. Mousa & Mohamed A. El-Shorbagy, 2021. "Trust-Region Based Penalty Barrier Algorithm for Constrained Nonlinear Programming Problems: An Application of Design of Minimum Cost Canal Sections," Mathematics, MDPI, vol. 9(13), pages 1-20, July.
    • Handle: RePEc:gam:jmathe:v:9:y:2021:i:13:p:1551-:d:586977
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/9/13/1551/pdf
    Download Restriction: no
    File URL: https://www.mdpi.com/2227-7390/9/13/1551/
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Sakineh Tahmasebzadeh & Hamidreza Navidi & Alaeddin Malek, 2015. "Novel Interior Point Algorithms for Solving Nonlinear Convex Optimization Problems," Advances in Operations Research, Hindawi, vol. 2015, pages 1-7, September.
    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. Luis Fernando Grisales-Noreña & Oscar Danilo Montoya & Brandon Cortés-Caicedo & Farhad Zishan & Javier Rosero-García, 2023. "Optimal Power Dispatch of PV Generators in AC Distribution Networks by Considering Solar, Environmental, and Power Demand Conditions from Colombia," Mathematics, MDPI, vol. 11(2), pages 1-20, January.
    2. Palanivel Kaliyaperumal & Amrit Das, 2022. "A Mathematical Model for Nonlinear Optimization Which Attempts Membership Functions to Address the Uncertainties," Mathematics, MDPI, vol. 10(10), pages 1-20, May.

    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:gam:jmathe:v:9:y:2021:i:13:p:1551-:d:586977. 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: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.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.