Suliman Al-Homidan
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Suliman Al-Homidan has a total of 54 co-authors. Here are the top co-authors by number of shared publications:
- Qamrul Hasan Ansari
King Fahd University of Petroleum and Minerals
17 shared publications - Izhar Ahmad
Department of Mathematics, Interdisciplinary Research Center for Intelligent Secure Systems, King Fahd University of Petroleum and Minerals, Dhahran, Saudi Arabia
10 shared publications - Abdulkarim Hassan Ibrahim
Emirates Aviation University
7 shared publications - Mohammed Alshahrani
Department of Mathematics, King Fahd University of Petroleum & Minerals, Dhahran, Saudi Arabia
7 shared publications - Javad Balooee
School of Mathematics, Statistics and Computer Science, College of Science, University of Tehran, Tehran, Iran
3 shared publications - Jen-Chih Yao
Research Center for Interneural Computing, China Medical University Hospital, China Medical University, Taichung, Taiwan
3 shared publications
Latest Publications
- 27 June 2026
- Published by Springer Nature in Arabian Journal for Science and Engineering
- Vol. 51 (13) , 16355-16364
Computing a Positive Semidefinite Arrowhead Matrix Closest to Noisy Data
- 27 June 2026
- Published by Springer Nature in Arabian Journal for Science and Engineering
- Vol. 51 (13) , 16355-16364
Computing a Positive Semidefinite Arrowhead Matrix Closest to Noisy Data
- 11 February 2026
- Published by Taylor & Francis in Optimization
- p. 1-20
A supermemory projection-based method for solving nonlinear equations with an application
- 11 February 2026
- Published by Taylor & Francis in Optimization
- p. 1-20
A supermemory projection-based method for solving nonlinear equations with an application
- Open Access
- 1 January 2026
- Published by Wiley in Journal of Mathematics
- Vol. 2026 (1)
Semidefinite Programming Approaches to Hankel Matrix Approximation and Completion via Primal–Dual Interior‐Point Methods
Data completion techniques offer numerous advantages in various fields. However, completing large datasets that must satisfy specific criteria can be challenging, necessitating the use of approximative completion methods. The primary objective of this research paper is to showcase the substantial influence of the initial point selection on the completed matrix, emphasizing the distinctiveness of solutions corresponding to each initial point. However, in the case of using the same initial point, a unique solution is attainable although the employed completion methods may exhibit variations. Each method utilized for the completion of Hankel positive semidefinite matrices strives to achieve a unique solution, assuming feasibility. Nevertheless, the path to reaching this solution can differ among methods due to variations in the number of iterations and accuracy measures required for convergence. The paper will extensively explore theoretical aspects, algorithmic advancements, and empirical findings related to completing Hankel matrices through semidefinite programming (SDP) and combining SDP with second‐order cone optimization (SOCP). The study will present numerical results to support the analyses conducted.
- 1 January 2026
- Published by Wiley in Journal of Mathematics
- Vol. 2026 (1)
Open AccessSemidefinite Programming Approaches to Hankel Matrix Approximation and Completion via Primal–Dual Interior‐Point Methods
Data completion techniques offer numerous advantages in various fields. However, completing large datasets that must satisfy specific criteria can be challenging, necessitating the use of approximative completion methods. The primary objective of this research paper is to showcase the substantial influence of the initial point selection on the completed matrix, emphasizing the distinctiveness of solutions corresponding to each initial point. However, in the case of using the same initial point, a unique solution is attainable although the employed completion methods may exhibit variations. Each method utilized for the completion of Hankel positive semidefinite matrices strives to achieve a unique solution, assuming feasibility. Nevertheless, the path to reaching this solution can differ among methods due to variations in the number of iterations and accuracy measures required for convergence. The paper will extensively explore theoretical aspects, algorithmic advancements, and empirical findings related to completing Hankel matrices through semidefinite programming (SDP) and combining SDP with second‐order cone optimization (SOCP). The study will present numerical results to support the analyses conducted.
- 10 September 2025
- Published by Springer Nature in Journal of Optimization Theory and Applications
- Vol. 208 (1) , 1-26
A Unified Derivative-Free Projection Framework for Convex-Constrained Nonlinear Equations
- 10 September 2025
- Published by Springer Nature in Journal of Optimization Theory and Applications
- Vol. 208 (1) , 1-26
A Unified Derivative-Free Projection Framework for Convex-Constrained Nonlinear Equations
- 2 May 2025
- Published by Emerald Publishing in Engineering Computations
- Vol. 42 (5) , 1717-1727
A spectral conjugate gradient method for motion control of robotic manipulators
Purpose: The purpose of this paper is to introduce a spectral conjugate gradient method specifically designed to solve unconstrained optimization problems, particularly concerning the motion control of a two-joint planar robotic manipulator.Design/methodology/approach: Our approach integrates a spectral parameter derived from the strong Wolfe line search with the conjugate gradient method of Dai and Kou. This approach is evaluated through computational simulations, demonstrating its effectiveness in motion control scenarios. Our design and methodology underscore a rigorous analytical framework combined with practical, application-oriented testing to validate the proposed algorithm’s efficiency and applicability in robotic motion control.Findings: We were able to find an effective way to select the spectral parameter, which is crucial for the optimization process in robotic motion control. This improved selection process directly contributes to enhanced numerical performance. Moreover, the implementation of the proposed method in motion control of a two-joint planar robotic manipulator demonstrates its effectiveness. This suggests that the approach not only works theoretically but also proves to be viable in practical, real-world applications. Furthermore, the findings indicate that this approach could potentially be adapted or extended to other types of robotic systems or motion control challenges.Originality/value: This paper introduces an enhancement to the spectral conjugate gradient method, marked by a clever parameter selection strategy originating from the strong Wolfe line search, tailored specifically for robotic motion control.
- 2 May 2025
- Published by Emerald Publishing in Engineering Computations
- Vol. 42 (5) , 1717-1727
A spectral conjugate gradient method for motion control of robotic manipulators
Purpose: The purpose of this paper is to introduce a spectral conjugate gradient method specifically designed to solve unconstrained optimization problems, particularly concerning the motion control of a two-joint planar robotic manipulator.Design/methodology/approach: Our approach integrates a spectral parameter derived from the strong Wolfe line search with the conjugate gradient method of Dai and Kou. This approach is evaluated through computational simulations, demonstrating its effectiveness in motion control scenarios. Our design and methodology underscore a rigorous analytical framework combined with practical, application-oriented testing to validate the proposed algorithm’s efficiency and applicability in robotic motion control.Findings: We were able to find an effective way to select the spectral parameter, which is crucial for the optimization process in robotic motion control. This improved selection process directly contributes to enhanced numerical performance. Moreover, the implementation of the proposed method in motion control of a two-joint planar robotic manipulator demonstrates its effectiveness. This suggests that the approach not only works theoretically but also proves to be viable in practical, real-world applications. Furthermore, the findings indicate that this approach could potentially be adapted or extended to other types of robotic systems or motion control challenges.Originality/value: This paper introduces an enhancement to the spectral conjugate gradient method, marked by a clever parameter selection strategy originating from the strong Wolfe line search, tailored specifically for robotic motion control.
- 7 April 2025
- Published by Springer Nature in Afrika Matematika
- Vol. 36 (2) , 1-14
Assessing loan eligibility through correlation matrix approximation for credit estimation
- 7 April 2025
- Published by Springer Nature in Afrika Matematika
- Vol. 36 (2) , 1-14
Assessing loan eligibility through correlation matrix approximation for credit estimation
- 14 November 2024
- Published by Elsevier in Applied Numerical Mathematics
- Vol. 209, 55-67
A derivative-free projection method with double inertial effects for solving nonlinear equations
- 14 November 2024
- Published by Elsevier in Applied Numerical Mathematics
- Vol. 209, 55-67
A derivative-free projection method with double inertial effects for solving nonlinear equations
- 13 August 2024
- Published by Springer Nature in Arabian Journal for Science and Engineering
- Vol. 50 (2) , 1329-1337
Approximating M-matrix in Learning Directed Acyclic Graphs Using Methods Involve Semidefinite Matrix Constraints
- 13 August 2024
- Published by Springer Nature in Arabian Journal for Science and Engineering
- Vol. 50 (2) , 1329-1337
Approximating M-matrix in Learning Directed Acyclic Graphs Using Methods Involve Semidefinite Matrix Constraints
- 9 August 2024
- Published by Springer Nature in Positivity
- Vol. 28 (4) , 1-11
A projection method for zeros of multi-valued monotone mappings
- 9 August 2024
- Published by Springer Nature in Positivity
- Vol. 28 (4) , 1-11
A projection method for zeros of multi-valued monotone mappings