WANG Hong-fu, ZHANG Shou, ZHAO Yong-fang, et al. Quantum mechanical algorithm for solving quadratic residueequation [ J ]. International Journal of Theoretical Physics, 2009, 48: 3262-3267.Quantum mechanical algorithm for solving quadratic residue equation. Hong-Fu Wang,Shou Zhang,Yong-Fang Zhao...
In this paper, we introduce a new iterative algorithm for solving a generalized Sylvester matrix equation of the formwhich includes a class of linear matrix equations. The objective of the algorithm is to minimize an error at each iteration by the idea of gradient-descent. We show that the pr...
The traditional gradient-descent algorithm for solving Eq. (1.5) takes the form: (1.11)wi=wi−1−μ∇wTJ(wi−1),i≥0, where i≥ 0 is an iteration index and μ > 0 is a small step-size parameter. Starting from some initial condition, w−1, the iterates {wi} correspond ...
This study introduces an enhanced self-adaptive wild goose algorithm (SAWGA) for solving economical-environmental-technical optimal power flow (OPF) problems in traditional and modern energy systems. Leveraging adaptive search strategies and robust diversity capabilities, SAWGA distinguishes itself from clas...
Solving this can be done using several strategies, for example, a random distribution and reassignment, keeping the best combinations in each step. But, to use a deterministic method, it is possible to establish the objective function given by the sum of squares errors (SSE) calculated by ...
A stable and efficient method for solving a convex quadratic program with application to optimal control SIAM J. Optim., 22 (4) (2012), pp. 1369-1393 CrossrefView in ScopusGoogle Scholar [23] V. Kungurtsev, J. Jaschke A predictor–corrector path-following algorithm for dual-degenerate param...
Numerical methods based on finite differences for solving the wave equation are prone to various errors, a challenge that also applies to the semi-discrete case of a recently proposed quantum algorithm that preserves continuous time while discretizing space into a quantum state vector. The inherent ...
In this paper, we present a new iterative method for solving the nonlinear complementarity problem. This method, which we call NE/SQP (for Nonsmooth Equations/Successive Quadratic Programming), is a damped Gauss—Newton algorithm applied to solve a certain nonsmooth-equation formulation of the comple...
Summary: The security of multivariate public-key cryptography is largely determined by the complexity of solving multivariate quadratic equations over finite fields, a.k.a. the MQ problem. XL (eXtended Linearization) is an efficient algorithm for solving the MQ problem, so its running time is an...
In this study, we concentrate on solving the problem of non-Lipschitz absolute value equations (NAVE). A new Bezier curve based smoothing technique is introduced and a new Levenberg–Marquardt type algorithm is developed depending on the smoothing techni