Zobrazeno 1 - 10
of 81
pro vyhledávání: '"Longquan Yong"'
Publikováno v:
Mathematics, Vol 12, Iss 16, p 2533 (2024)
In this study, an improved discontinuous deformation analysis method with sub-block strategy is introduced to numerically simulate mixed-mode fractures. This approach partitions the material domain into continuum and potential discontinuum regions, a
Externí odkaz:
https://doaj.org/article/23cdb7d6a890466a84c3c3e43844918c
Publikováno v:
Axioms, Vol 13, Iss 6, p 343 (2024)
This paper presents a nonstandard numerical manifold method (NMM) for solving Burgers’ equation. Employing the characteristic Galerkin method, we initially apply the Crank–Nicolson method for temporal discretization along the characteristic. Subs
Externí odkaz:
https://doaj.org/article/6b90a4d763544385b07974ca4c2be3f9
Publikováno v:
Mathematics, Vol 12, Iss 10, p 1596 (2024)
This paper presents a novel variant of the teaching–learning-based optimization algorithm, termed BLTLBO, which draws inspiration from the blended learning model, specifically designed to tackle high-dimensional multimodal complex optimization prob
Externí odkaz:
https://doaj.org/article/228724eb030a482fa91b07e473233b3c
Publikováno v:
IEEE Access, Vol 8, Pp 188784-188796 (2020)
By reformulating the linear multiplicative programming problem (LMP) as an equivalent nonconvex programming problem (EP), we present a new accelerating outcome space branch-and-bound algorithm for globally solving the problem (LMP). Firstly, a linear
Externí odkaz:
https://doaj.org/article/c82f5af54b78486fabf064f16becb3a8
Autor:
Longquan Yong
Publikováno v:
Axioms, Vol 11, Iss 8, p 370 (2022)
Linear complementarity problem (LCP) is studied. After reforming general LCP as the system of nonlinear equations by NCP-function, LCP is equivalent to solving an unconstrained optimization model, which can be solved by a recently proposed algorithm
Externí odkaz:
https://doaj.org/article/5f006e54fbd249b2b11d21b3f6eaa2fa
Publikováno v:
Complexity, Vol 2018 (2018)
In this study, a generalized Taylor series formula together with residual error function, which is named the residual power series method (RPSM), is used for finding the series solution of the time fractional Benjamin-Bona-Mahony-Burger (BBM-Burger)
Externí odkaz:
https://doaj.org/article/654ffbef67384900a6218c26483f2951
Publikováno v:
PLoS ONE, Vol 12, Iss 4, p e0175114 (2017)
Harmony Search (HS) and Teaching-Learning-Based Optimization (TLBO) as new swarm intelligent optimization algorithms have received much attention in recent years. Both of them have shown outstanding performance for solving NP-Hard optimization proble
Externí odkaz:
https://doaj.org/article/153e98130f8e4405b21cf6def14290a8
Autor:
Longquan Yong
Publikováno v:
Journal of Applied Mathematics, Vol 2014 (2014)
The method of least absolute deviation (LAD) finds applications in many areas, due to its robustness compared to the least squares regression (LSR) method. LAD is robust in that it is resistant to outliers in the data. This may be helpful in studies
Externí odkaz:
https://doaj.org/article/d9beb8ab0d164eb9998359a6b5c6702a
Publikováno v:
The Scientific World Journal, Vol 2014 (2014)
To enhance the performance of harmony search (HS) algorithm on solving the discrete optimization problems, this paper proposes a novel harmony search algorithm based on teaching-learning (HSTL) strategies to solve 0-1 knapsack problems. In the HSTL a
Externí odkaz:
https://doaj.org/article/ed14a3deba1448ceacb5b8268618d353
Publikováno v:
Journal of Applied Mathematics, Vol 2012 (2012)
Harmony search (HS) method is an emerging metaheuristic optimization algorithm. In this paper, an improved harmony search method based on differential mutation operator (IHSDE) is proposed to deal with the optimization problems. Since the population
Externí odkaz:
https://doaj.org/article/8021d6e81c58459ebe558811e4ab9f20