Sign inSubmit
Tips: “quotes” for a phrase · author:Lee · a DOI goes straight to its article

10 results for “Abbas Y. Al-Bayati”

Set a search alert
Research ArticleOpen accessIn the author namesNew Scaled Sufficient Descent Conjugate Gradient Algorithm for Solving Unconstraint Optimization ProblemsAbbas Y. AL-Bayati, Rafiq S. MuhammadProblem statement: The scaled hybrid Conjugate Gradient (CG) algorithm which usually used for solving non-linear functions was presented and was compared with two standard well-Known NAG routines, yielding a new fast comparable algorithm. Approach: We proposed, a new hybrid technique based on the combination of two well-known scaled (CG) formulas for the quadratic model in unconstrained optimization using exact line … …Journal of Computer Science, Vol. 6, Issue 5 · 31 May 2010 · 7,053 accessesView PDFCite
Research ArticleOpen accessIn the author namesA New Separable Logarithmic Algorithm for Non-Linear OptimizationAbbas Y. Al-Bayati, Hawraz N. JabbarProblem statement: The idea of this study stemmed from the fact that most of the currently used optimization algorithms use a local quadratic representation of the objective function. It also arisen from the fact that the objective function may not be represented adequately by quadratic functions and the global minimizer may be obtained for objective functions. So, in this study, … …Journal of Computer Science, Vol. 6, Issue 5 · 31 May 2010 · 6,874 accessesView PDFCite
Research ArticleOpen accessIn the author namesA Modified Conjugate Gradient Formula for Back Propagation Neural Network AlgorithmAbbas Y. Al Bayati, Najmaddin A. Sulaiman, Gulnar W. SadiqProblem statement: The Conjugate Gradient (CG) algorithm which usually used for solving nonlinear functions is presented and is combined with the modified Back Propagation (BP) algorithm yielding a new fast training multilayer algorithm. Approach: This study consisted of determination of new search directions by exploiting the information calculated by gradient descent as well as the previous search direction. The proposed … …Journal of Computer Science, Vol. 5, Issue 11 · 30 Dec 2009 · 6,994 accessesView PDFCite
Research ArticleOpen accessIn the author namesResidues of Complex Functions with Definite and Infinite Poles on X-axisAbbas Y. AL-Bayati, Sasan A. Al-ShwaniProblem statement: One of the most popular areas in the mathematics is the computational complex analysis. In this study several computational complex techniques were investigated and implemented numerically. Objective: This study produced new procedures to compute the residues of complex functions by changing their numerator from a constant number to either even or odd function. Approach: In this project we … …Journal of Mathematics and Statistics, Vol. 5, Issue 3 · 30 Sep 2009 · 7,052 accessesView PDFCite
Research ArticleOpen accessIn the author namesThe Existence, Uniqueness and Error Bounds of Approximation Splines Interpolation for Solving Second-Order Initial Value ProblemsAbbas Y. Al Bayati, Rostam K. Saeed, Faraidun K. Hama-SalhProblem statement: The lacunary interpolation problem, which we had investigated in this study, consisted in finding the six degree spline S(x) of deficiency four, interpolating data given on the function value and third and fifth order in the interval [0,1]. Also, an extra initial condition was prescribed on the first derivative. Other purpose of this construction was to solve the … …Journal of Mathematics and Statistics, Vol. 5, Issue 2 · 30 Jun 2009 · 8,176 accessesView PDFCite
Research ArticleOpen accessIn the author namesTwo-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,113 accessesView PDFCite
Research ArticleOpen accessIn the author namesAn Original Geometric Programming Problem Algorithm to Solve Two Coefficients Sensitivity AnalysisAbbas Y. Al-Bayati, Huda E. KhalidProblem statement: It has been noticed by Dinkel and Kochenberger that they developed sensitivity procedure for Posynomial Geometric Programming Problems based on making a small changes in one coefficient. Approach: This study presented an original algorithm for finding the ranging analysis while studying the effect of perturbations in the original coefficients without resolving the problem, this proposed procedure had been … …American Journal of Engineering and Applied Sciences, Vol. 2, Issue 2 · 30 Jun 2009 · 7,371 accessesView PDFCite
Research ArticleOpen accessIn the author namesA New Three-Term Preconditioned Gradient memory Algorithm for Nonlinear Optimization ProblemsAbbas Y. AL-Bayati, Ivan S. LatifIn the present study, we proposed a three-term of preconditioned gradient memory algorithms to solve a nonlinear optimization problem. The new algorithm subsumes some other families of nonlinear preconditioned gradient memory algorithms as its subfamilies with Powell's Restart Criterion and inexact Armijo line searches. Numerical experiments on twenty one well-known test functions with various dimensions generally encouraged and showed that … …Journal of Mathematics and Statistics, Vol. 4, Issue 2 · 30 Jun 2008 · 6,783 accessesView PDFCite