arXiv subjects

Sajad Fathi Hafshejani

Publications and source records attributed to Sajad Fathi Hafshejani.

6 recordsLinked to original sources

arXiv2024

Quantum Algorithms for Optimal Power Flow

This paper explores the use of quantum computing, specifically the use of HHL and VQLS algorithms, to solve optimal power flow problem in electrical grids. We investigate the effectiveness of these quantum algorithms in comparison to classical methods. The simulation results presented here which substantially improve the results in [1] indicate that quantum approaches yield similar solutions and optimal costs compared to classical methods, suggesting the potential use case of quantum computing for power system optimization.

quant-ph↗

arXiv2024

A hybrid quantum solver for the Lorenz system

We develop a hybrid classical-quantum method for solving the Lorenz system. We use the forward Euler method to discretize the system in time, transforming it into a system of equations. This set of equations is solved using the Variational Quantum Linear Solver (VQLS) algorithm. We present numerical results comparing the hybrid method with the classical approach for solving the Lorenz system. The simulation results demonstrate that the VQLS method can effectively compute solutions comparable to classical methods. The method is easily extended to solving similar nonlinear differential equations.

quant-ph↗

arXiv2024

A Hybrid Quantum Algorithm for Load Flow

The goal of the load flow study is to ensure that electrical power is delivered efficiently and reliably to end-users while maintaining the stability and security of the power system. Newton-Raphson is a numerical method used widely for load flow analysis. One of the most computationally expensive steps in this method is an equation-solving step. We propose to replace this step with HHL, a quantum algorithm for solving linear systems of equations. HHL is exponentially faster, but with caveats. In this study, a hybrid quantum algorithm is proposed for solving load flow. The Newton-Raphson method is used as a benchmark to compare the performance of the hybrid quantum algorithm. Although the simulation of the hybrid quantum algorithm takes much time, these preliminary results are encouraging and point to the potential for the use of quantum algorithms to develop hybrid quantum algorithms for load flow analysis and related problems.

eess.SY↗

arXiv2022

A new trigonometric kernel function for support vector machine

In the last few years, various types of machine learning algorithms, such as Support Vector Machine (SVM), Support Vector Regression (SVR), and Non-negative Matrix Factorization (NMF) have been introduced. The kernel approach is an effective method for increasing the classification accuracy of machine learning algorithms. This paper introduces a family of one-parameter kernel functions for improving the accuracy of SVM classification. The proposed kernel function consists of a trigonometric term and differs from all existing kernel functions. We show this function is a positive definite kernel function. Finally, we evaluate the SVM method based on the new trigonometric kernel, the Gaussian kernel, the polynomial kernel, and a convex combination of the new kernel function and the Gaussian kernel function on various types of datasets. Empirical results show that the SVM based on the new trigonometric kernel function and the mixed kernel function achieve the best classification accuracy. Moreover, some numerical results of performing the SVR based on the new trigonometric kernel function and the mixed kernel function are presented.

cs.LG↗

arXiv2021

Barzilai and Borwein conjugate gradient method equipped with a non-monotone line search technique and its application on non-negative matrix factorization

In this paper, we propose a new non-monotone conjugate gradient method for solving unconstrained nonlinear optimization problems. We first modify the non-monotone line search method by introducing a new trigonometric function to calculate the non-monotone parameter, which plays an essential role in the algorithm's efficiency. Then, we apply a convex combination of the Barzilai-Borwein method for calculating the value of step size in each iteration. Under some suitable assumptions, we prove that the new algorithm has the global convergence property. The efficiency and effectiveness of the proposed method are determined in practice by applying the algorithm to some standard test problems and non-negative matrix factorization problems.

math.OC↗

arXiv2021

Initialization for Nonnegative Matrix Factorization: a Comprehensive Review

Non-negative matrix factorization (NMF) has become a popular method for representing meaningful data by extracting a non-negative basis feature from an observed non-negative data matrix. Some of the unique features of this method in identifying hidden data put this method amongst the powerful methods in the machine learning area. The NMF is a known non-convex optimization problem and the initial point has a significant effect on finding an efficient local solution. In this paper, we investigate the most popular initialization procedures proposed for NMF so far. We describe each method and present some of their advantages and disadvantages. Finally, some numerical results to illustrate the performance of each algorithm are presented.

math.OC↗