IDEAS home Printed from https://ideas.repec.org/a/ibn/masjnl/v4y2010i10p133.html
   My bibliography  Save this article

A New Method for Unconstrained Optimization Problem

Author

Listed:
  • Zhiguang Zhang

Abstract

This paper presents a new memory gradient method for unconstrained optimization problems. This method makes use of the current and previous multi-step iteration information to generate a new iteration and add the freedom of some parameters. Therefore it is suitable to solve large scale unconstrained optimization problems. The global convergence is proved under some mild conditions. Numerical experiments show the algorithm is efficient in many situations.

Suggested Citation

  • Zhiguang Zhang, 2010. "A New Method for Unconstrained Optimization Problem," Modern Applied Science, Canadian Center of Science and Education, vol. 4(10), pages 133-133, October.
    • Handle: RePEc:ibn:masjnl:v:4:y:2010:i:10:p:133
    as

    Download full text from publisher

    File URL: https://ccsenet.org/journal/index.php/mas/article/download/7655/5848
    Download Restriction: no
    File URL: https://ccsenet.org/journal/index.php/mas/article/view/7655
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Z. J. Shi & J. Shen, 2005. "New Inexact Line Search Method for Unconstrained Optimization," Journal of Optimization Theory and Applications, Springer, vol. 127(2), pages 425-446, November.
    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. Sheng-Tong Zhou & Di Wang & Qian Xiao & Jian-min Zhou & Hong-Guang Li & Wen-Bing Tu, 2021. "An improved first order reliability method based on modified Armijo rule and interpolation-based backtracking scheme," Journal of Risk and Reliability, , vol. 235(2), pages 209-229, April.
    2. Zhang, Qiang & Liu, Jijun, 2024. "On fluorophore imaging by nonlinear diffusion model with dynamical iterative scheme," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 221(C), pages 533-549.
    3. Ping Hu & Xu-Qing Liu, 2013. "A Nonmonotone Line Search Slackness Technique for Unconstrained Optimization," Journal of Optimization Theory and Applications, Springer, vol. 158(3), pages 773-786, September.
    4. Vieira, Douglas Alexandre Gomes & Lisboa, Adriano Chaves, 2014. "Line search methods with guaranteed asymptotical convergence to an improving local optimum of multimodal functions," European Journal of Operational Research, Elsevier, vol. 235(1), pages 38-46.
    5. Shi, Zhenjun & Wang, Shengquan, 2011. "Nonmonotone adaptive trust region method," European Journal of Operational Research, Elsevier, vol. 208(1), pages 28-36, January.
    6. Long, Jiancheng & Szeto, W.Y., 2019. "Congestion and environmental toll schemes for the morning commute with heterogeneous users and parallel routes," Transportation Research Part B: Methodological, Elsevier, vol. 129(C), pages 305-333.
    7. Antoine Soubeyran, 2022. "Variational rationality. Self regulation success as a succession of worthwhile moves that make sufficient progress," Working Papers hal-04041238, HAL.
    8. Antoine Soubeyran, 2023. "Variational rationality. Self regulation success as a succession of worthwhile moves that make sufficient progress," AMSE Working Papers 2307, Aix-Marseille School of Economics, France.

    More about this item

    JEL classification:

    • R00 - Urban, Rural, Regional, Real Estate, and Transportation Economics - - General - - - General
    • Z0 - Other Special Topics - - General

    Statistics

    Access and download statistics

    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:ibn:masjnl:v:4:y:2010:i:10:p:133. 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: Canadian Center of Science and Education (email available below). General contact details of provider: https://edirc.repec.org/data/cepflch.html .

    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.