Reducing Computation Time in DFP (Davidon, Fletcher & Powell) Update Method for Solving Unconstrained Optimization Problems

被引:3
|
作者
Sofi, A. Z. M. [1 ]
Mamat, M. [2 ]
Ibrahim, M. A. H. [3 ]
机构
[1] Kolej Univ Islam Antarabangsa Selangor KUIS Selan, Fac Sci & Informat Technol, Dept Skills & Core Subjects, Kajang 43000, Selangor DE, Malaysia
[2] Univ Malaysia Terengganu, Fac Sci & Technol, Dept Math, Kuala Terengganu 21300, Malaysia
[3] KLIUC, Sch Appl Sci & Fdn, Kajang 43000, Selangar, Malaysia
关键词
DFP update; unconstrained optimization; time computing; global convergence; EXACT LINE SEARCH; ALGORITHM;
D O I
10.1063/1.4801284
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
Solving the unconstrained optimization problems is not easy and DFP update method is one of the methods that we can work with to solve the problems. In unconstrained optimization, the time computing needed by the method's algorithm to solve the problems is very vital and because of that, we proposed a hybrid search direction for DFP update method in order to reduce the computation time needed for solving unconstrained optimization problems. Some convergence analysis and numerical results of the hybrid search direction were analyzed and the results showed that the proposed hybrid search direction strictly reduce the computation time needed by DFP update method and at the same time increase the method's efficiency which is sometimes fail for some complicated unconstrained optimization problems.
引用
收藏
页码:1337 / 1345
页数:9
相关论文
共 50 条
  • [31] New Coefficient of Three-Term Conjugate Gradient Method for Solving Unconstrained Optimization Problems
    Fadhilah, Nurul Hafawati
    Rivaie, Mohd
    Ishak, Fuziyah
    Idalisa, Nur
    [J]. PROCEEDINGS OF THE INTERNATIONAL CONFERENCE ON MATHEMATICAL SCIENCES AND TECHNOLOGY 2018 (MATHTECH 2018): INNOVATIVE TECHNOLOGIES FOR MATHEMATICS & MATHEMATICS FOR TECHNOLOGICAL INNOVATION, 2019, 2184
  • [32] An accelerated first-order method for solving SOS relaxations of unconstrained polynomial optimization problems
    Bertsimas, Dimitris
    Freund, Robert M.
    Sun, Xu Andy
    [J]. OPTIMIZATION METHODS & SOFTWARE, 2013, 28 (03): : 424 - 441
  • [33] A Sparse Quasi-Newton Method Based on Automatic Differentiation for Solving Unconstrained Optimization Problems
    Cao, Huiping
    An, Xiaomin
    [J]. SYMMETRY-BASEL, 2021, 13 (11):
  • [34] On the performance of a new symmetric rank-one method with restart for solving unconstrained optimization problems
    Khiyabani, Farzin Modarres
    Leong, Wah June
    [J]. COMPUTERS & MATHEMATICS WITH APPLICATIONS, 2012, 64 (06) : 2141 - 2152
  • [35] RECON - A method for reducing computation time in numerical reload pattern optimization
    Heimann, C
    Anton, G
    Krosche, M
    [J]. ANNUAL MEETING ON NUCLEAR TECHNOLOGY '99, PROCEEDINGS, 1998, : 53 - 56
  • [36] Modifications for Quasi-Newton Method and Its Spectral Algorithm for Solving Unconstrained Optimization Problems
    Sadraddin, Evar Lutfalla
    Latif, Ivan Subhi
    [J]. BAGHDAD SCIENCE JOURNAL, 2024, 21 (06) : 2070 - 2078
  • [37] An Efficient Single-Parameter Scaling Memoryless Broyden-Fletcher-Goldfarb-Shanno Algorithm for Solving Large Scale Unconstrained Optimization Problems
    Lv, Jing
    Deng, Songhai
    Wan, Zhong
    [J]. IEEE ACCESS, 2020, 8 (08): : 85664 - 85674
  • [38] A PRP-HS Type Hybrid Nonlinear Conjugate Gradient Method for Solving Unconstrained Optimization Problems
    Adeleke, Olawale J.
    Olusanya, Micheal O.
    Osinuga, Idowu A.
    [J]. INTELLIGENT SYSTEMS APPLICATIONS IN SOFTWARE ENGINEERING, VOL 1, 2019, 1046 : 58 - 68
  • [39] A Numerical Study for Solving Unconstrained Optimization Problems Using Method of Three-Term Conjugate Gradient
    Hameed, Nasmah Jameel
    Saeed, Hamsa Th
    [J]. PROCEEDING OF THE 2ND 2022 INTERNATIONAL CONFERENCE ON COMPUTER SCIENCE AND SOFTWARE ENGINEERING (CSASE 2022), 2022, : 127 - 131
  • [40] An efficient modified PRP-FR hybrid conjugate gradient method for solving unconstrained optimization problems
    Mtagulwa, Peter
    Kaelo, P.
    [J]. APPLIED NUMERICAL MATHEMATICS, 2019, 145 : 111 - 120