4 articles for “Large-scale unconstrained optimization”

Set a search alert

Research ArticleOpen accessPhrase in the titleMemoryless Modified Symmetric Rank-One Method for Large-Scale Unconstrained OptimizationFarzin Modarres, Malik Abu Hassan, Wah June LeongProblem statement: Memoryless QN methods have been regarded effective techniques for solving large-scale problems that can be considered as one step limited memory QN methods. In this study, we present a scaled memoryless modified Symmetric Rank-One (SR1) algorithm and investigate the numerical performance of the proposed algorithm for solving large-scale unconstrained optimization problems. Approach: The basic idea is to apply … …American Journal of Applied Sciences, Vol. 6, Issue 12 · 31 Dec 2009 · 7,981 accessesView PDF Cite

Research ArticleOpen accessIn the abstractA Robust Modification of Hestenes–Stiefel Conjugate Gradient Method with Strong Wolfe Line SearchAwad Abdelrahman, Osman O.O. Yousif, Khalid I. OsmanNonlinear Conjugate Gradient (CG) methods are extensively used for solving large-scale unconstrained optimization problems. Numerous of studies constructed scales and modifications have been conducted recently to improve (CG) methods. In this paper, a simple modified by its conjugate gradient method was proposed. In addition to, established global convergence property and sufficient descent condition, under Strong Wolfe line search. Numerical result … …Journal of Mathematics and Statistics, Vol. 16, Issue 1 · 14 May 2020 · 6,743 accessesView PDF Cite

Research ArticleOpen accessAll words, across the recordA New Spectral Conjugate Gradient Method for Nonlinear Unconstrained OptimizationIbtisam A. Masmali, Zabidin Salleh, Ahmad AlhawaratTheconjugate gradient method is widely used to solve large scale unconstrainedoptimization problems. However, the rate of convergence conjugate gradient method is linearunless it restarted. In this study, we present a new spectral conjugategradient modification formula with restart property obtains the globalconvergence and descent properties.In addition, we proposed a new restart condition for Fletcher-Reeves conjugate gradient formula. The numerical resultsdemonstrated that … …Journal of Computer Science, Vol. 17, Issue 6 · 5 Jul 2021 · 6,653 accessesView PDF Cite

Research ArticleOpen accessAll words, across the recordTwo-Versions of Conjugate Gradient-Algorithms Based on Conjugacy Conditions for Unconstrained OptimizationAbbas Y. AL-Bayati, A.J. Salim, Khalel K. AbboProblem statement: (CG) algorithms, which we had investigated in this study, were widely used in optimization, especially for large scale optimization problems, because it did not need the storage of any matrix. The purpose of this construction was to find new CG-algorithms suitable for solving large scale optimization problems. Approach: Based on pure conjugacy condition and quadratic convex function two … …American Journal of Economics and Business Administration, Vol. 1, Issue 2 · 30 Jun 2009 · 8,108 accessesView PDF Cite