Siti Farhana Husin
Mathematical optimizationCPU timeBroyden–Fletcher–Goldfarb–Shanno algorithmMatrix (mathematics)Optimization problemRegression analysisGradient descentMethod of steepest descentIterative methodLinear approximationFocus (optics)Scale (ratio)Descent (mathematics)Applied mathematicsUnconstrained optimizationMathematicsComputer scienceLinear regressionConvergence (routing)Conjugate gradient methodLine searchProperty (programming)
4Publications
1H-index
1Citations
Publications 4
Newest
#1Siti Farhana HusinH-Index: 1
Last. Mohd RivaieH-Index: 8
view all 4 authors...
This study employs exact line search iterative algorithms for solving large scale unconstrained optimization problems in which the direction is a three-term modification of iterative method with two different scaled parameters. The objective of this research is to identify the effectiveness of the new directions both theoretically and numerically. Sufficient descent property and global convergence analysis of the suggested methods are established. For numerical experiment purposes, the methods a...
Source
#1Siti Farhana HusinH-Index: 1
Last. Mohd RivaieH-Index: 8
view all 4 authors...
Source
In this paper, we develop a new search direction for Steepest Descent (SD) method by replacing previous search direction from Conjugate Gradient (CG) method, , with gradient from the previous step, for solving large-scale optimization problem. We also used one of the conjugate coefficient as a coefficient for matrix . Under some reasonable assumptions, we prove that the proposed method with exact line search satisfies descent property and possesses the globally convergent. Further, the numerical...
Source
#2Nurul ‘AiniH-Index: 1
Last. Mohd RivaieH-Index: 8
view all 5 authors...
In this paper, we focus on the steepest descent and quasi-Newton method in solving unconstrained optimization problem. Therefore, we develop a new search direction for hybrid BFGS-ZMRI method with global convergence properties. Based on the numerical result, our method shows significant improvement in the number of iteration and CPU time.In this paper, we focus on the steepest descent and quasi-Newton method in solving unconstrained optimization problem. Therefore, we develop a new search direct...
Source
This website uses cookies.
We use cookies to improve your online experience. By continuing to use our website we assume you agree to the placement of these cookies.
To learn more, you can find in our Privacy Policy.