Author:
H. Dwail Hasan,M. A. K. Shiker
Abstract
Abstract
The trust region method is one of the important and effective ways to solve optimization problems due to its robust and accuracy in its convergence. One of its disadvantages is that its algorithm needs much time to solve its subproblems especially in the case of the problems that have a large-scale data. In this work, a new algorithm is suggested to solve this problem specifically subspace TRM. The initial TRR will be adequate to the subproblems which can be solved with a simple subspace, it will be simpler to solve than the classic TRM. The global convergence of the new method is investigated. The numerical results indicated that the new approach is promising.
Cited by
28 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. New conjugate gradient formula for unconstrained optimization;AIP Conference Proceedings;2024
2. Using Markov Models And Fault Tree For Finding The Reliability Of Some Engineering Problems;2023 6th International Conference on Engineering Technology and its Applications (IICETA);2023-07-15
3. Solving Bi-Objective Reliability Optimization Problem of Mixed System by Firefly Algorithm;2023 6th International Conference on Engineering Technology and its Applications (IICETA);2023-07-15
4. A new technique for modifying the Hungarian method;INTERNATIONAL CONFERENCE OF COMPUTATIONAL METHODS IN SCIENCES AND ENGINEERING ICCMSE 2021;2023
5. A new technique to solve the maximization of the transportation problems;INTERNATIONAL CONFERENCE OF COMPUTATIONAL METHODS IN SCIENCES AND ENGINEERING ICCMSE 2021;2023