IDEAS home Printed from https://ideas.repec.org/a/spr/joptap/v125y2005i1d10.1007_s10957-004-1718-2.html
   My bibliography  Save this article

New Modified Function Method for Global Optimization

Author

Listed:
  • Z. Y. Wu

    (Chongqing Normal University)

  • L. S. Zhang

    (Shanghai University)

  • K. L. Teo

    (Hong Kong Polytechnic University)

  • F. S. Bai

    (Fudan University)

Abstract

In this paper, a class of global optimization problems is considered. Corresponding to each local minimizer obtained, we introduced a new modified function and construct a corresponding optimization subproblem with one constraint. Then, by applying a local search method to the one-constraint optimization subproblem and using the local minimizer as the starting point, we obtain a better local optimal solution. This process is continued iteratively. A termination rule is obtained which can serve as stopping criterion for the iterating process. To demonstrate the efficiency of the proposed approach, numerical examples are solved.

Suggested Citation

  • Z. Y. Wu & L. S. Zhang & K. L. Teo & F. S. Bai, 2005. "New Modified Function Method for Global Optimization," Journal of Optimization Theory and Applications, Springer, vol. 125(1), pages 181-203, April.
    • Handle: RePEc:spr:joptap:v:125:y:2005:i:1:d:10.1007_s10957-004-1718-2
    DOI: 10.1007/s10957-004-1718-2
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10957-004-1718-2
    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-004-1718-2?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.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Immanuel Bomze & Chen Ling & Liqun Qi & Xinzhen Zhang, 2012. "Standard bi-quadratic optimization problems and unconstrained polynomial reformulations," Journal of Global Optimization, Springer, vol. 52(4), pages 663-687, April.
    2. Gao, Yuelin & Yang, Yongjian & You, Mi, 2015. "A new filled function method for global optimization," Applied Mathematics and Computation, Elsevier, vol. 268(C), pages 685-695.
    3. Long, Qiang & Wu, Changzhi & Wang, Xiangyu, 2015. "A system of nonsmooth equations solver based upon subgradient method," Applied Mathematics and Computation, Elsevier, vol. 251(C), pages 284-299.

    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:125:y:2005:i:1:d:10.1007_s10957-004-1718-2. 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.