homotopy continuation
Recently Published Documents


TOTAL DOCUMENTS

248
(FIVE YEARS 28)

H-INDEX

27
(FIVE YEARS 2)

2022 ◽  
Vol 3 (1) ◽  
pp. 1-20
Author(s):  
Stuart M. Harwood ◽  
Dimitar Trenev ◽  
Spencer T. Stober ◽  
Panagiotis Barkoutsos ◽  
Tanvi P. Gujarati ◽  
...  

The variational quantum eigensolver (VQE) is a hybrid quantum-classical algorithm for finding the minimum eigenvalue of a Hamiltonian that involves the optimization of a parameterized quantum circuit. Since the resulting optimization problem is in general nonconvex, the method can converge to suboptimal parameter values that do not yield the minimum eigenvalue. In this work, we address this shortcoming by adopting the concept of variational adiabatic quantum computing (VAQC) as a procedure to improve VQE. In VAQC, the ground state of a continuously parameterized Hamiltonian is approximated via a parameterized quantum circuit. We discuss some basic theory of VAQC to motivate the development of a hybrid quantum-classical homotopy continuation method. The proposed method has parallels with a predictor-corrector method for numerical integration of differential equations. While there are theoretical limitations to the procedure, we see in practice that VAQC can successfully find good initial circuit parameters to initialize VQE. We demonstrate this with two examples from quantum chemistry. Through these examples, we provide empirical evidence that VAQC, combined with other techniques (an adaptive termination criteria for the classical optimizer and a variance-based resampling method for the expectation evaluation), can provide more accurate solutions than “plain” VQE, for the same amount of effort.


2021 ◽  
Vol 11 (22) ◽  
pp. 10666
Author(s):  
Guangjun Cui ◽  
Shenghua Xiong ◽  
Cuiying Zhou ◽  
Zhen Liu

Prediction of soft soil settlement is an important research topic in the field of civil engineering, and the least square support vector machine is one of the commonly used prediction methods at present. Nonetheless, the existing LSSVM models have problems of low search efficiency in the search process and lack of global optimal solution in the search results. In order to solve this problem, based on the leave-one-out cross-validation method, the homotopy continuation method was used to optimize the LSSVM model parameters, and then the HC-LSSVM model was constructed with the goal of minimizing the sum of squares of the prediction error of the full sample retention one. Finally, the rationality and correctness of the model are verified by engineering application. The results show that the HC-LSSVM model constructed in this study can accurately predict the settlement of soft ground, which is superior to the common LSSVM model and solves the problem that the parameters of LSSVM model cannot be solved optimally. The research results provide a new method for prediction of soft soil settlement.


Author(s):  
Yingjie Ma ◽  
Jie Li

Process synthesis using rigorous unit operation models is highly desirable to identify the most efficient pathway for sustainable production of fuels and value-added chemicals. However, it often leads to a large-scale strongly nonlinear and nonconvex mixed integer nonlinear programming (MINLP) model. In this work, we propose two robust homotopy continuation enhanced branch and bound (HCBB) algorithms (denoted as HCBB-FP and HCBB-RB) where the homotopy continuation method is employed to gradually approach the optimal solution of the NLP subproblem at a node from the solution at its parent node. A variable step length is adapted to effectively balance feasibility and computational efficiency. The computational results demonstrate that the proposed HCBB algorithms can find the same optimal solution from different initial points, while the existing MINLP algorithms fail or find much worse solutions. In addition, HCBB-RB is superior to HCBB-FP due to lower computational effort required for the same locally optimal solution.


2021 ◽  
Vol 47 (5) ◽  
Author(s):  
Sascha Timme

AbstractThis article develops a new predictor-corrector algorithm for numerical path tracking in the context of polynomial homotopy continuation. In the corrector step, it uses a newly developed Newton corrector algorithm which rejects an initial guess if it is not an approximate zero. The algorithm also uses an adaptive step size control that builds on a local understanding of the region of convergence of Newton’s method and the distance to the closest singularity following Telen, Van Barel, and Verschelde. To handle numerically challenging situations, the algorithm uses mixed precision arithmetic. The efficiency and robustness are demonstrated in several numerical examples.


Author(s):  
Luca Ferranti ◽  
Kalle Astrom ◽  
Magnus Oskarsson ◽  
Jani Boutellier ◽  
Juho Kannala

2021 ◽  
Vol 3 (2) ◽  
Author(s):  
Zouhair Saffah ◽  
Abdelaziz Timesli ◽  
Hassane Lahmam ◽  
Abderrahim Azouani ◽  
Mohamed Amdi

AbstractThe goal of this work is to develop a numerical method combining Radial Basic Functions (RBF) kernel and a high order algorithm based on Taylor series and homotopy continuation method. The local RBF approximation applied in strong form allows us to overcome the difficulties of numerical integration and to treat problems of large deformations. Furthermore, the high order algorithm enables to transform the nonlinear problem to a set of linear problems. Determining the optimal value of the shape parameter in RBF kernel is still an outstanding research topic. This optimal value depends on density and distribution of points and the considered problem for e.g. boundary value problems, integral equations, delay-differential equations etc. These have been extensively attempts in literature which end up choosing this optimal value by tests and error or some other ad-hoc means. Our contribution in this paper is to suggest a new strategy using radial basis functions kernel with an automatic reasonable choice of the shape parameter in the nonlinear case which depends on the accuracy and stability of the results. The computational experiments tested on some examples in structural analysis are performed and the comparison with respect to the state of art algorithms from the literature is given.


Sign in / Sign up

Export Citation Format

Share Document