Norhaslinda Zullpakkal
Norhaslinda Zullpakkal has a total of 9 co-authors. Here are the top co-authors by number of shared publications:
Ainur Madihah Mohd Nordin
Universiti Teknologi MARA Cawangan Terengganu,Faculty of Computer and Mathematical Sciences,Terengganu,Malaysia
1 shared publication- Ibrahim Mohammed Sulaiman
College of Applied and Health Sciences, A’Sharqiyah University, Ibra, Oman
1 shared publication Muhammad Ariiq Iqbaal Azizul Firdaus
Universiti Teknologi MARA Cawangan Terengganu,Faculty of Computer and Mathematical Sciences,Terengganu,Malaysia
1 shared publication- Norrlaili Shapiee
Tamhidi Centre, Universiti Sains Islam Malaysia, Bandar Baru Nilai, 71800 Nilai, Negeri Sembilan, MALAYSIA
1 shared publication - Nur Atikah Salahudin
Universiti Teknologi MARA Cawangan Terengganu,Faculty of Computer and Mathematical Sciences,Terengganu,Malaysia
1 shared publication - Nur Idalisa
Universiti Teknologi MARA Caw, Terengganu Kampus Dungun,Fakulti Sains Komputer dan Matematik,Dungun,Terengganu,Malaysia,23000
1 shared publication
Latest Publications
- 2 September 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 323-327
Hybrid Conjugate Gradient Using Exact Line Search in Photovoltaic System
Unconstrained optimization is the process of determining the maximum or minimum value among all potential values of the variable in the absence of any constraints. The conjugate gradient (CG) method is widely recognised as one of the most efficient numerical methods for solving unconstrained optimization problems. Various studies have been undertaken by implementing the CG method in image restoration, optimal rocket landing guidance and motion control field. There are a few classifications of CG method such as classical, hybrid, three-term and parametric CG methods. This research focuses on the performance of hybrid CG method under exact line search and the implementation of this method in photovoltaic system. There are four hybrid CG coefficients used in this study, which are hybridizations of the Polak-Ribiere-Polyak (PRP) with the Linda-Aini-Mustafa-Rivaie (LAMR), Rivaie-Mustafa-Ismail-Leong (RMIL), Liu-Storey (LS) and Hestenes-Stiefel (HS). Fifteen test functions with different initial points and variables ranged from 2 to $\mathbf{1 0, 0 0 0}$ variables are chosen. The numerical results are assessed based on number of iteration (NOI) and central processing unit (CPU) time. In order to evaluate the efficiency and robustness of these methods, the results are visualized in graphical form. PRPLS, PRPLAMR and PRPRMIL successfully solved all 15 test functions while PRPHS solved 99.72% of the test functions. The efficiency and robustness of each coefficients are evaluated. At last, PRPLS is implemented in photovoltaic system, specifically in the maximum power point tracking (MPPT) algorithm. This study shows the effectiveness of PRPLS in solving problem of maximizing the power output generated by the photovoltaic system.- 2 September 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 323-327
Hybrid Conjugate Gradient Using Exact Line Search in Photovoltaic System
Unconstrained optimization is the process of determining the maximum or minimum value among all potential values of the variable in the absence of any constraints. The conjugate gradient (CG) method is widely recognised as one of the most efficient numerical methods for solving unconstrained optimization problems. Various studies have been undertaken by implementing the CG method in image restoration, optimal rocket landing guidance and motion control field. There are a few classifications of CG method such as classical, hybrid, three-term and parametric CG methods. This research focuses on the performance of hybrid CG method under exact line search and the implementation of this method in photovoltaic system. There are four hybrid CG coefficients used in this study, which are hybridizations of the Polak-Ribiere-Polyak (PRP) with the Linda-Aini-Mustafa-Rivaie (LAMR), Rivaie-Mustafa-Ismail-Leong (RMIL), Liu-Storey (LS) and Hestenes-Stiefel (HS). Fifteen test functions with different initial points and variables ranged from 2 to $\mathbf{1 0, 0 0 0}$ variables are chosen. The numerical results are assessed based on number of iteration (NOI) and central processing unit (CPU) time. In order to evaluate the efficiency and robustness of these methods, the results are visualized in graphical form. PRPLS, PRPLAMR and PRPRMIL successfully solved all 15 test functions while PRPHS solved 99.72% of the test functions. The efficiency and robustness of each coefficients are evaluated. At last, PRPLS is implemented in photovoltaic system, specifically in the maximum power point tracking (MPPT) algorithm. This study shows the effectiveness of PRPLS in solving problem of maximizing the power output generated by the photovoltaic system.- 19 March 2025
- Published by World Scientific Pub Co Pte Ltd in International Journal of Computational Methods
- Vol. 22 (07)
A Descent Three-Term Conjugate Gradient Direction for Problems of Unconstrained Optimization with Application
This study introduces an improved three-term conjugate gradient (CG) algorithm which fulfills the descent conditions and exhibits good global convergence properties. The development of this new algorithm is based on the findings of recently introduced generalized RMIL CG technique. The algorithm has been modified so that the search direction would always meet the sufficient descent condition no matter the line-search techniques employed. Under some given assumptions, the algorithm’s global convergence result for the general nonconvex functions is established. The numerical efficacy of the suggested three-term CG algorithm is assessed through comparisons with four other CG algorithms. The assessment is performed using an array of unconstrained optimization benchmark functions. The acquired findings indicate that all the considered algorithms exhibit similar performance, particularly the variants of the RMIL method. One algorithm is more robust and slightly faster than the rest. However, it is essential to highlight that the newly developed CG formula outperforms all the other algorithms, including a recently presented three-term PRP algorithm. The study further expanded the proposed method to address an image restoration problem. The computational experiments yielded promising results, proving that the proposed CG algorithm surpasses others. It produces higher-quality output images, requires less CPU time (sec), and achieves higher PSNR values.
- 19 March 2025
- Published by World Scientific Pub Co Pte Ltd in International Journal of Computational Methods
- Vol. 22 (07)
A Descent Three-Term Conjugate Gradient Direction for Problems of Unconstrained Optimization with Application
This study introduces an improved three-term conjugate gradient (CG) algorithm which fulfills the descent conditions and exhibits good global convergence properties. The development of this new algorithm is based on the findings of recently introduced generalized RMIL CG technique. The algorithm has been modified so that the search direction would always meet the sufficient descent condition no matter the line-search techniques employed. Under some given assumptions, the algorithm’s global convergence result for the general nonconvex functions is established. The numerical efficacy of the suggested three-term CG algorithm is assessed through comparisons with four other CG algorithms. The assessment is performed using an array of unconstrained optimization benchmark functions. The acquired findings indicate that all the considered algorithms exhibit similar performance, particularly the variants of the RMIL method. One algorithm is more robust and slightly faster than the rest. However, it is essential to highlight that the newly developed CG formula outperforms all the other algorithms, including a recently presented three-term PRP algorithm. The study further expanded the proposed method to address an image restoration problem. The computational experiments yielded promising results, proving that the proposed CG algorithm surpasses others. It produces higher-quality output images, requires less CPU time (sec), and achieves higher PSNR values.