Figure 1.
Kernel estimation from coarse to fine under the multi-scale deblurring framework.
In numerical computation, locating multiple roots of nonlinear equations (NESs) in a single run is a challenging work. In order to solve the problem of population grouping and parameters settings during the evolutionary, a clustering-based adaptive speciation differential evolution, referred to as CASDE, is presented to deal with NESs. CASDE offers three advantages: 1) the clustering with dynamic clustering sizes is used to set clustering sizes for different problems; 2) adaptive parameter control at the niche level is proposed to enhance the search ability and efficiency; 3) re-initialization mechanism motivates the algorithm to search new roots and saves computing resources. To evaluate the performance of CASDE, we select 30 problems with different features as test suite. Experimental results indicate that the speciation clustering with dynamic clustering sizes, niche adaptive parameter control, and re-initialization mechanism when combined together in a synergistic manner can improve the ability to find multiple roots in a single run. Additionally, our method is also compared with other state-of-the-art methods, which is capable of obtaining better results in terms of peak ratio and success rate. Finally, two practical mechanical problems are used to verify the performance of CASDE, and it also demonstrates superior results.
Citation: Qishuo Pang, Xianyan Mi, Jixuan Sun, Huayong Qin. Solving nonlinear equation systems via clustering-based adaptive speciation differential evolution[J]. Mathematical Biosciences and Engineering, 2021, 18(5): 6034-6065. doi: 10.3934/mbe.2021302
| [1] | Shahbaz Ahmad, Adel M. Al-Mahdi, Rashad Ahmed . Two new preconditioners for mean curvature-based image deblurring problem. AIMS Mathematics, 2021, 6(12): 13824-13844. doi: 10.3934/math.2021802 |
| [2] | Suparat Kesornprom, Prasit Cholamjiak . A modified inertial proximal gradient method for minimization problems and applications. AIMS Mathematics, 2022, 7(5): 8147-8161. doi: 10.3934/math.2022453 |
| [3] | Damrongsak Yambangwai, Tanakit Thianwan . An efficient iterative algorithm for common solutions of three G-nonexpansive mappings in Banach spaces involving a graph with applications to signal and image restoration problems. AIMS Mathematics, 2022, 7(1): 1366-1398. doi: 10.3934/math.2022081 |
| [4] | Shahbaz Ahmad, Faisal Fairag, Adel M. Al-Mahdi, Jamshaid ul Rahman . Preconditioned augmented Lagrangian method for mean curvature image deblurring. AIMS Mathematics, 2022, 7(10): 17989-18009. doi: 10.3934/math.2022991 |
| [5] | Xiao Guo, Chuanpei Xu, Zhibin Zhu, Benxin Zhang . Nonmonotone variable metric Barzilai-Borwein method for composite minimization problem. AIMS Mathematics, 2024, 9(6): 16335-16353. doi: 10.3934/math.2024791 |
| [6] | Bolin Song, Zhenhao Shuai, Yuanyuan Si, Ke Li . Blind2Grad: Blind detail-preserving denoising via zero-shot with gradient regularized loss. AIMS Mathematics, 2025, 10(6): 14140-14166. doi: 10.3934/math.2025637 |
| [7] | Ziqing Du, Yaru Li, Guangming Lv . Evaluating the nonlinear relationship between nonfinancial corporate sector leverage and financial stability in the post crisis era. AIMS Mathematics, 2022, 7(11): 20178-20198. doi: 10.3934/math.20221104 |
| [8] | H. M. Barakat, Magdy E. El-Adll, M. E. Sobh . Bootstrapping m-generalized order statistics with variable rank. AIMS Mathematics, 2022, 7(8): 13704-13732. doi: 10.3934/math.2022755 |
| [9] | Chih-Hung Chang, Ya-Chu Yang, Ferhat Şah . Reversibility of linear cellular automata with intermediate boundary condition. AIMS Mathematics, 2024, 9(3): 7645-7661. doi: 10.3934/math.2024371 |
| [10] | Shabir Ahmad, Saud Fahad Aldosary, Meraj Ali Khan . Stochastic solitons of a short-wave intermediate dispersive variable (SIdV) equation. AIMS Mathematics, 2024, 9(5): 10717-10733. doi: 10.3934/math.2024523 |
In numerical computation, locating multiple roots of nonlinear equations (NESs) in a single run is a challenging work. In order to solve the problem of population grouping and parameters settings during the evolutionary, a clustering-based adaptive speciation differential evolution, referred to as CASDE, is presented to deal with NESs. CASDE offers three advantages: 1) the clustering with dynamic clustering sizes is used to set clustering sizes for different problems; 2) adaptive parameter control at the niche level is proposed to enhance the search ability and efficiency; 3) re-initialization mechanism motivates the algorithm to search new roots and saves computing resources. To evaluate the performance of CASDE, we select 30 problems with different features as test suite. Experimental results indicate that the speciation clustering with dynamic clustering sizes, niche adaptive parameter control, and re-initialization mechanism when combined together in a synergistic manner can improve the ability to find multiple roots in a single run. Additionally, our method is also compared with other state-of-the-art methods, which is capable of obtaining better results in terms of peak ratio and success rate. Finally, two practical mechanical problems are used to verify the performance of CASDE, and it also demonstrates superior results.
Image blur, such as motion blur, is a common disturbance in real-world photography applications. Therefore, image deblurring is of great importance for further practical vision tasks. Motion blur can be modeled as the covolution of the sharp image and blur kernel, which is typically unknown in real-world scenarios. The image degradation can be modeled as:
| B=L⊗K+n, | (1.1) |
where B, L, and K denote the motion-blurred image, the sharp image, and the blur kernel (point spread function), respectively, and n represents the additive white Gaussian noise with a mean of 0 and a standard deviation of σ, which is introduced during the image degradation process. The symbol ⊗ denotes the convolution operator.
Blind deblurring aims to reconstruct both the blur kernel K and the sharp latent image L from a blurred input image B. However, this process is ill-posed because different combinations of L and K can produce identical outputs of B. To address this problem, it is essential to incorporate prior knowledge to avoid the local optimal solution.
Researchers have extensively explored the optimization of blur kernels modeled with prior knowledge of images in recent years[1,2,3]. Li et al. [4] utilized a deep network to formulate the image prior as a binary classifier. Levin et al. [5] employed hyper-Laplacian priors to model the latent image and derived a simple approximation method to optimize the maximum a posteriori (MAP). In the pursuit of developing an efficient blind deblurring method, various prior terms tailored to enhance image clarity have been integrated within the MAP framework[6,7,8]. Krishnan et al. [9] utilized an L1/L2 regularization scheme to sparsely represent the gradient image, whose main feature is to adapt the L1 norm regularization by using the L2 norm of the image gradient as the weight in the iterative process. However, this approach is not conducive to recovering image details in the early stages of the optimization process. Meanwhile, Xu et al. [10] proposed an unnatural L0 norm sparse representation to eliminate detrimental small-amplitude structures, providing a unified framework for both uniform and non-uniform motion deblurring. Liu et al. [11] explored that the surface maps of intermediate latent images containing detrimental structures typically have a large surface area, and they introduced an additional surface-perception a prior based on the use of the L0 norm to enforce sparsity on the image gradient, thereby preserving sharp edges and removing unfavorable microstructures from the intermediate latent images.
These methods still fail when dealing with images containing more saturated pixels and large blur kernels. Therefore, recent works concentrate on the image reconstruction with outliers for non-blind deblurring[12] and blind deblurring tasks[13,14,15]. Chen et al. [16] proposed to remove the outliers by adopting a confidence map and further shrunk the outliers by multiplying with its inverse value[17]. Zhang et al. [18] proposed an intermediate image correction method for saturated pixels to improve the quality of saturated image restoration by screening the intermediate image using Bayesian a posteriori estimation and excluding pixel points that adversely affect the blur kernel estimation. Much progress has been made in blurred image estimation for natural images and in image reconstruction techniques, but there are still several major problems with the current blind deblurring algorithms. First, most current motion blur estimation methods are based on images with a linear blurring process[19,20,21]. In practice, blurred images are often accompanied by large noise and outlier points, such as saturated pixel points, and linear blur models cannot effectively describe saturated pixel points, leading to their poor performance in processing blurred images with outlier pixels. In particular, blurred images taken in low-light environments will contain large noise and outlier points. Therefore, how to effectively cope with the interference caused by saturated pixels has great practical value.
Recently, deep learning methods based on Bayes theory have also developed[22,23,24]. Kingma et al. [22] proposed the auto-encoding variational Bayesian algorithm, where the encoder maps the input into a distribution within the latent space, and the decoder maps the sample points from the latent space to the input space. Zhang et al. [20] and Ren et al. [23] constructed blind deblurring networks based on the MAP estimation. However, these deep learning-based methods can easily fail when the data distribution is different from the training data. For this reason, the proposed method focuses on the conventional iterative blind deblurring method.
This work investigates the blind deblurring optimization model for saturated pixels established under the MAP framework. By solving the intermediate image and blur kernel by alternating iterations, the blur kernel will eventually converge to the blur kernel of the observed image. In order to overcome the highly ill-posed problem of blind deblurring, the image regularity and the blur kernel regularity are usually used to constrain the model. Although the dark channel prior (DCP) has achieved excellent results, when dealing with images with larger blur kernels or saturated pixels, the results are often unsatisfactory. Therefore, we utilize the pixel screening strategy [18] to further correct the intermediate images with large blur kernels or saturated pixels. By distinguishing whether a pixel conforms to the linear degradation assumption, the proposed method reduces the influence of unfavorable structure to obtain a more accurate blur kernel.
We use the MAP probability estimation to construct a probabilistic modeling framework between a sharp image, a blur kernel, and a blurred image. Given the blurred image, the sharp image and the blur kernel are estimated by maximizing a posterior probability based on the assumption that the sharp image L and the blur kernel K are independent of each other. According to the conditional probability formula, we obtain
| (L,K)=argmaxL,KP(L,K∣B)=argmaxL,KP(B∣L,K)∗P(L)∗P(K)P(B). | (2.1) |
Taking the negative logarithms on both sides of the above equation, we derive a new form that is equivalent to the original probability density function:
| −logP(L,K∣B)∝−logP(B∣L,K)−logP(L)−logP(K). | (2.2) |
Assume that n is an additive white Gaussian noise with a mean of 0 and a variance of σ, and the variable B follows a normal distribution, provided that L and K are known. The solution of L and K is transformed into the following minimization problem:
| (L,K)=argminL,K‖L⊗K−B‖22+Φ(L)+Ψ(K). | (2.3) |
The first term on the right-hand side is the data fitting term, and the second and third terms are regularization terms, which involve a priori knowledge, including statistical and distribution properties about the sharp image and blur kernel. Blind deblurring is to estimate the blur kernel and then recover the sharp image from the blurred image.
The motion blur is usually caused by relative motion between the camera and the subject. This motion causes pixels shifting in a specific direction and distance, thus resulting in image degradation. Assume all values in the blur kernel are greater than or equal to 0, and the sum is 1, that is,
| K(z)≥0, ∑z∈ΩkK(z)=1, |
where Ω is the whole image space.
Since blur kernels are sparse, we constrain the possible blur kernels as follows:
| Ψ(K)=‖K‖p, | (2.4) |
where ‖⋅‖p denotes the p norm operator. As the L2 norm constraint focuses more on the smoothness of the blur kernel, this leads to more stable results for kernel estimation. Therefore, we use the L2 norm to constrain the blur kernel in this paper.
The dark channel is a natural metric for distinguishing sharp images from blurry images[25]. He et al. [26] first proposed dark channels for image haze removal. The dark channel of image L can be defined as the minimum value of an image patch as follows:
| Ci,j(L)=minN(i,j)(minc∈{r,g,b}Lci,j), | (2.5) |
where N(i,j) is the image patch centered at pixel (i,j). Experiments show that the dark channels of sharp images are more sparse. The possible reason is that the image blur is a weighted sum of pixel values within the local neighborhood, thereby increasing the dark channel pixels. Therefore, we use the L0 norm of the dark channel as the image regularization.
The deblurring model based on the DCP is to solve the following problem:
| minL,K‖L⊗K−B‖22+λ‖D(L)‖0+μ‖∇L‖0+γ‖K‖22. | (2.6) |
The first term of this formula is a fidelity item that constrains the output of the convolution of the recovered image with the blur kernel to be as similar as possible to the observed result. The ‖∇L‖0 term is used to preserve large image gradients and ‖D(L)‖0 is used to measure the dark channel sparsity. The blind deconvolution method commonly optimizes L and K alternately during the iterative process. The main purpose of this alternating iterative optimization is to progressively refine the motion blur kernel K and the latent image L.
In this work, the following two subproblems are solved by the alternating iteration method:
| minL‖L⊗K−B‖22+λ‖D(L)‖0+μ‖∇L‖0, minK‖L⊗K−B‖22+γ‖K‖22. | (2.7) |
Specifically, for the k-th iterative process, L can be solved using the fast Fourier transform. When L is given, kernel estimation in Eq (2.7) is a least-squares problem. The gradient-based kernel estimation methods have shown superiority [11], and the kernel estimation model as follows:
| Kk+1=argminK‖∇Lk+1⊗Kk−∇B‖22+γ‖Kk‖22. | (2.8) |
Normally, blind image deblurring follows the basic linear blurring assumption Eq (1.1). However, methods based on this assumption do not yield satisfactory results in recovering images with a high number of saturated pixels. When outliers are present, intermediate potential images, estimated using methods with traditional data fidelity items, contain significant artifacts. Even a small number of outliers severely degrade the quality of the estimated blur kernel because these outliers often do not fit the linear model.
An effective way to identify and discard outliers during the iterative process is assigning different weights to the pixels while updating the latent image and the blur kernel. Those pixels categorized as outliers are assigned a weight equal to zero to ensure that they do not affect the subsequent iterations[18]. We introduce variable Z to determine whether the pixel (i,j) complies with the linearity assumption[12], and the intermediate correction operator is defined as
| Pk+1i,j=P(Zk+1i,j=1∣Bi,j,Kk,Lk+1). | (2.9) |
According to the Bayes formula, we have
| P(Zk+1ij=1∣Bij,Kk,Lk+1)=P(Bij∣Zk+1ij=1,Kk,Lk+1)P(Zk+1ij=1∣Kk,Lk+1)P(Bij∣Kk,Lk+1). | (2.10) |
In this work, we assume that the noise n obeys a Gaussian distribution with a mean of 0 and a variance σ2. When
| Zk+1ij=1, |
the degradation assumption holds, and we obtain
| P(Bij∣Zk+1ij=1,Kk,Lk+1)=φij, | (2.11) |
where
| φij∼N((Lk+1∗Kk)ij,σ2). |
When
| Zk+1ij=0, |
pixel (i,j) is considered an outlier. The posterior distribution is approximated by a uniform distribution as follows:
| P(Bij∣Zk+1ij=0,Kk,Lk+1)=1/(b−a), | (2.12) |
where b and a correspond to the maximum and minimum values of the input image, respectively.
Given the intermediate image Lk+1 and kernel Kk, we use p0 to represent the percentage of image pixels that deviate from the linear model. The probability of a pixel conforming to Eq (1.1) can be defined as
| P(Zk+1ij=0∣Kk,Lk+1)=p0, | (2.13) |
and we generally assume that about 0–10 % of the pixels are deviated. The probability of satisfying the linearity assumption Eq (1.1) for a given intermediate blur kernel and intermediate image is defined as
| P(Zk+1ij=1∣Kk,Lk+1)=1−p0. | (2.14) |
According to the full probability formula, we obtain
| P(Bij∣Kk,Lk+1)=∑Zij=0,1P(Bij∣Zk+1ij,Kk,Lk+1)P(Zk+1ij∣Kk,Lk+1)=φij(1−p0)+p0(b−a). | (2.15) |
Thus, with the above definitions, the pixel screening operator P is calculated as follows:
| Pk+1i,j=φij(1−p0)φij(1−p0)+p0/(b−a). | (2.16) |
During the iterative process, after obtaining the estimated intermediate image, we alternate the estimation of the blurring kernel. Based on the intermediate correction operator, we screen and correct the pixels of intermediate images. For those pixels with a high probability of deviation, which means they have greater disadvantageous impact for blur kernel estimation, they are appropriately corrected. With the corrected intermediate image, we solve the following model to estimate the blur kernel:
| Kk+1=argminK‖∇(Lk+1∘P)⊗K−∇B‖22+γ‖K‖22, | (2.17) |
where ∘ is the matrix dot product operator.
As shown in Figure 1, this work is carried out in the framework of multi-scale deblurring, where kernel estimation is carried out from a coarse to a fine scheme with an image pyramid. With the color input image, we first transform it to a grayscale image. We use the image to create a pyramid and resize the blur kernel with a down-sampling operation, thus a set of multi-resolution images is obtained. Starting from the smallest level, the structure of the whole image is restored and we recover the rough blur kernel using the correction operator. As the image and kernel resolution improve, the finer details are gradually restored.
In order to verify the effectiveness of this method, we conduct numerical experiments on both synthetic and real-world image datasets to compare the processing effects of the dark channel blind deblurring method before and after the correction improvement. We set the parameters
| λ=0.003,μ=0.003,andγ=2, |
and p is an adjustable parameter in the range of 0.02 to 0.1. Figure 2 compares the results on the Levin dataset[5] by adjusting p from 0.02 to 0.16. The results show that the deblurring performance relies on the choice of p. The more outliers present, the higher the value of p, which will provide better results.
The experimental hardware configuration is an Intel Core i5-10300 CPU, NVIDlA GeForce GTX 1650 GPU, 16.0 GB RAM, the software configuration operating system is Windows 10 (64-bit). We use the PSNR and structural similarity (SSIM) as our evaluation metrics.
We use the Levin dataset [5] and Köhler dataset [27] to evaluate our method. The Levin dataset is a standard benchmark dataset that consists of 32 blurred images synthesized from 4 original images and 8 different convolution kernels, with each image size of 255×255. The Köhler dataset is a standard benchmark dataset that consists of 48 blurred images synthesized from 4 original images and 12 different convolutional kernels, with each image size of 800×800. We compare our method with DCP[25], PMP[28], LMG[21], and Sat[17] to demonstrate the effectiveness of our method.
In Figure 3, the left figure shows the PSNR comparison between the proposed method and state-of-the-art methods, where our method significantly improves the PSNR metric. The right figure shows the error ratio comparison with and without intermediate correction. It can be seen that the proposed method has the smallest error ratio. As shown in Figure 3 and Table 1, experimental results on the Levin dataset demonstrate that the deblurring algorithm proposed in this paper achieves significant performance improvements across a wide range of blur types and degrees. The improved method recovery results obtain higher PSNR and SSIM values, and its ability to reach a 100% success rate faster proves its effectiveness in removing blur of different types and degrees.
Figure 4 shows that our method recovers the image and kernel with less artifacts and higher quality.
As shown in Figure 5 and Table 2, experimental results on the Köhler dataset show that our proposed deblurring method achieves significant performance improvement, and the recovery results obtain higher PSNR and SSIM values, demonstrating its effectiveness for image quality improvement. Figure 6 shows that the deblurred image of the proposed method obtains most restoration performance with the least ringing artifacts. The restored kernel of the proposed method is more clean and the image has the best visual quality.
As shown in Figure 7, we compare the dark channels of intermediate results with and without the intermediate correction. Without the correction strategy, our method reduces to the DCP-based method[25]. The intermediate results show that our method restores more sharp edges and clear blurry kernels. The final recovered image contains more details that demonstrate that our method improves the deblurring quality for saturated images.
Estimating motion kernels from blurred images with saturated pixel regions is challenging in image processing. As shown in Figure 8, we present three blurry images with saturated pixels to demonstrate the performance of our method. The first column shows blurry images, and the second and the third column are the results of the DCP[25] and ours, respectively. The results show that with the intermediate correction, it not only improves the quality of the recovered images, but also restores more clear blurry trajectories.
In this work, we introduce a blind deblurring method based on the DCP with an intermediate image correction strategy. In order to remove the disadvantageous effect of outliers, such as saturated pixels, we correct the intermediate image during the deblurring process. By assigning different weights to intermediate images, we improve the kernel estimation performance and thus enhance the final image restoration quality. Experimental results show that our method can significantly improve the accuracy and robustness of blur estimation when dealing with blurred images containing noise and outlier pixels.
Min Xiao: writing—original draft; Jinkang Zhang: writing—original draft; Zijin Zhu: writing—review and editing; Meina Zhang: methodology, supervision. All authors have read and agreed to the published version of the manuscript.
The authors declare they have not used Artificial Intelligence (AI) tools in the creation of this article.
This work is supported by the Science Foundation of China University of Petroleum, Beijing (No. 2462023YJRC008), Foundation of National Key Laboratory of Computational Physics (No. 6142A05QN23005), Postdoctoral Fellowship Program of CPSF (Nos. GZC20231997 and 2024M752451), National Natural Science Foundation of China (No. 62372467).
The authors have no conflicts to disclose.
| [1] |
M. Kastner, Phase transitions and configuration space topology, Rev. Mod. Phys., 80 (2008), 167-187. doi: 10.1103/RevModPhys.80.167
|
| [2] | D. Guo, Z. Nie, L. Yan, The application of noise-tolerant ZD design formula to robots' kinematic control via time-varying nonlinear equations solving, IEEE Trans. Syst., Man, Cybern.: Syst., 48 (2017), 2188-2197. |
| [3] | H. D. Chiang, T. Wang, Novel homotopy theory for nonlinear networks and systems and its applications to electrical grids, IEEE Trans. Control Network Syst., 5 (2017), 1051-1060. |
| [4] |
F. Facchinei, C. Kanzow, Generalized nash equilibrium problems, Ann. Oper. Res., 175 (2010), 177-211. doi: 10.1007/s10479-009-0653-x
|
| [5] | Z. Sun, J. Wu, J. Pei, Z. Li, Y. Huang, J. Yang, Inclined geosynchronous spaceborne cairborne bistatic sar: Performance analysis and mission design, IEEE Trans. Geosci. Remote Sens., 54 (2015), 343-357. |
| [6] |
Y. Song, L. Xing, M. Wang, Y. Yi, W. Xiang, Z. Zhang, A knowledge-based evolutionary algorithm for relay satellite system mission scheduling problem, Comput. Ind. Eng., 150 (2020), 106830. doi: 10.1016/j.cie.2020.106830
|
| [7] |
R. Storn, K. Price, Differential evolution-a simple and efficient adaptive scheme for global optimization over continuous spaces, J. Global Opt., 11 (1997), 341-359. doi: 10.1023/A:1008202821328
|
| [8] |
A. P. Piotrowski, J. J. Napiorkowski, Step-by-step improvement of jade and shade-based algorithms: Success or failure?, Swarm Evol. Comput., 43 (2018), 88-108. doi: 10.1016/j.swevo.2018.03.007
|
| [9] |
J. N. Bharothu, M. Sridhar, R. S. Rao, Modified adaptive differential evolution based optimal operation and security of ac-dc microgrid systems, Int. J. Electr. Power Energy Syst., 103 (2018), 185-202. doi: 10.1016/j.ijepes.2018.05.003
|
| [10] |
S. Li, Q. Gu, W. Gong, B. Ning, An enhanced adaptive differential evolution algorithm for parameter extraction of photovoltaic models, Energy Convers. Manage., 205 (2020), 112443. doi: 10.1016/j.enconman.2019.112443
|
| [11] |
A. W. Mohamed, A. A. Hadi, K. M. Jambi, Novel mutation strategy for enhancing shade and lshade algorithms for global numerical optimization, Swarm Evol. Comput., 50 (2019), 100455. doi: 10.1016/j.swevo.2018.10.006
|
| [12] |
J. Pierezan, R. Z. Freire, L. Weihmann, G. Reynoso-Meza, L. dos Santos Coelho, Static force capability optimization of humanoids robots based on modified self-adaptive differential evolution, Comput. Oper. Res., 84 (2017), 205-215. doi: 10.1016/j.cor.2016.10.011
|
| [13] | L. dos Santos Coelho, H. V. H. Ayala, V. C. Mariani, A self-adaptive chaotic differential evolution algorithm using gamma distribution for unconstrained global optimization, Appl. Math. Comput., 234 (2014), 452-459. |
| [14] |
G. Li, Q. Lin, L. Cui, Z. Du, Z. Liang, J. Chen, et al., A novel hybrid differential evolution algorithm with modified code and jade, Appl. Soft Comput., 47 (2016), 577-599. doi: 10.1016/j.asoc.2016.06.011
|
| [15] |
P. Civicioglu, E. Besdok, Bezier search differential evolution algorithm for numerical function optimization: A comparative study with crmlsp, mvo, wa, shade and lshade, Expert Syst. Appl., 165 (2021), 113875. doi: 10.1016/j.eswa.2020.113875
|
| [16] |
F. Zhao, L. Zhao, L. Wang, H. Song, A collaborative lshade algorithm with comprehensive learning mechanism, Appl. Soft Comput., 96 (2020), 106609. doi: 10.1016/j.asoc.2020.106609
|
| [17] |
W. Gong, Z. Liao, X. Mi, L. Wang, Y. Guo, Nonlinear equations solving with intelligent optimization algorithms: A survey, Complex Syst. Model. Simul., 1 (2021), 15-32. doi: 10.23919/CSMS.2021.0002
|
| [18] |
E. Pourjafari, H. Mojallali, Solving nonlinear equations systems with a new approach based on invasive weed optimization algorithm and clustering, Swarm Evol. Comput., 4 (2012), 33-43. doi: 10.1016/j.swevo.2011.12.001
|
| [19] | G. C. Ramadas, E. M. Fernandes, A. A. Rocha, Multiple roots of systems of equations by repulsion merit functions, in International Conference on Computational Science and Its Applications, Springer, Cham, (2014), 126-139. |
| [20] | A. K. Jain, M. N. Murty, P. J. Flynn, Data clustering: A review, ACM Comput. Surv., 31 (1999), 264-323. |
| [21] |
I. Tsoulos, A. Stavrakoudis, On locating all roots of systems of nonlinear equations inside bounded domain using global optimization methods, Nonlinear Anal.: Real World Appl., 11 (2010), 2465-2471. doi: 10.1016/j.nonrwa.2009.08.003
|
| [22] |
G. Karafotias, M. Hoogendoorn, A. E. Eiben, Parameter control in evolutionary algorithms: Trends and challenges, IEEE Trans. Evol. Comput., 19 (2015), 167-187. doi: 10.1109/TEVC.2014.2308294
|
| [23] |
A. K. Qin, V. L. Huang, P. N. Suganthan, Differential evolution algorithm with strategy adaptation for global numerical optimization, IEEE Trans. Evol. Comput., 13 (2009), 398-417. doi: 10.1109/TEVC.2008.927706
|
| [24] |
J. Zhang, A. C. Sanderson, JADE: Adaptive differential evolution with optional external archive, IEEE Trans. Evol. Comput., 13 (2009), 945-958. doi: 10.1109/TEVC.2009.2014613
|
| [25] |
S. Yang, J. Wang, Y. Ma, Y. Tu, Multi-response online parameter design based on bayesian vector autoregression model, Comput. Ind. Eng., 149 (2020), 106775. doi: 10.1016/j.cie.2020.106775
|
| [26] | W. Gong, Y. Wang, Z. Cai, L. Wang, Finding multiple roots of nonlinear equation systems via a repulsion-based adaptive differential evolution, IEEE Trans. Syst. Man Cybern. Syst., 50 (2018), 1499-1513. |
| [27] |
Y. Guo, H. Yang, M. Chen, J. Cheng, D. Gong, Ensemble prediction-based dynamic robust multi-objective optimization methods, Swarm Evol. Comput., 48 (2019), 156-171. doi: 10.1016/j.swevo.2019.03.015
|
| [28] | Y. N. Guo, X. Zhang, D. W. Gong, Z. Zhang, J. J. Yang, Novel interactive preference-based multi-objective evolutionary optimization for bolt supporting networks, IEEE Trans. Evol. Comput., 24 (2019), 750-764. |
| [29] |
C. Grosan, A. Abraham, A new approach for solving nonlinear equations systems, IEEE Trans. Syst., Man Cybern., Part A: Syst. Humans, 38 (2008), 698-714. doi: 10.1109/TSMCA.2008.918599
|
| [30] |
W. Song, Y. Wang, H. X. Li, Z. Cai, Locating multiple optimal solutions of nonlinear equation systems based on multiobjective optimization, IEEE Trans. Evol. Comput., 19 (2015), 414-431. doi: 10.1109/TEVC.2014.2336865
|
| [31] |
W. Gong, Y. Wang, Z. Cai, S. Yang, A weighted biobjective transformation technique for locating multiple optimal solutions of nonlinear equation systems, IEEE Trans. Evol. Comput., 21 (2017), 697-713. doi: 10.1109/TEVC.2017.2670779
|
| [32] | Y. R. Naidu, A. K. Ojha, Solving multiobjective optimization problems using hybrid cooperative invasive weed optimization with multiple populations, IEEE Trans. Syst., Man, Cybern.: Syst., 48 (2016), 821-832. |
| [33] | W. Sacco, N. Henderson, Finding all solutions of nonlinear systems using a hybrid metaheuristic with fuzzy clustering means, Appl. Soft Comput. 11 (2011), 5424-5432. |
| [34] |
L. Freitas, G. Platt, N. Henderson, Novel approach for the calculation of critical points in binary mixtures using global optimization, Fluid Phase Equilib., 225 (2004), 29-37. doi: 10.1016/j.fluid.2004.06.063
|
| [35] |
N. Henderson, W. F. Sacco, G. M. Platt, Finding more than one root of nonlinear equations via a polarization technique: An application to double retrograde vaporization, Chem. Eng. Res. Des., 88 (2010), 551-561. doi: 10.1016/j.cherd.2009.11.001
|
| [36] |
R. M. A. Silva, M. G. C. Resende, P. M. Pardalos, Finding multiple roots of a box-constrained system of nonlinear equations with a biased random-key genetic algorithm, J. Global Opt., 60 (2014), 289-306. doi: 10.1007/s10898-013-0105-7
|
| [37] | Z. Liao, W. Gong, X. Yan, L. Wang, C. Hu, Solving nonlinear equations system with dynamic repulsion-based evolutionary algorithms, IEEE Trans. Syst., Man, Cybern.: Syst., 50 (2018), 1590-1601. |
| [38] | A. F. Kuri-Morales, R. H. No, D. México, Solution of simultaneous non-linear equations using genetic algorithms, WSEAS Trans. Syst., 2 (2003), 44-51. |
| [39] | A. Pourrajabian, R. Ebrahimi, M. Mirzaei, M. Shams, Applying genetic algorithms for solving nonlinear algebraic equations, Appl. Math. Comput., 219 (2013), 11483-11494. |
| [40] |
W. Gao, G. G. Yen, S. Liu, A cluster-based differential evolution with self-adaptive strategy for multimodal optimization, IEEE Trans. Cybern., 44 (2014), 1314-1327. doi: 10.1109/TCYB.2013.2282491
|
| [41] | Q. Yang, W. N. Chen, Y. Li, C. L. Chen, X. M. Xu, J. Zhang, Multimodal estimation of distribution algorithms, IEEE Trans. Cybern., 47 (2016), 636-650. |
| [42] |
C. A. Floudas, Recent advances in global optimization for process synthesis, design and control: Enclosure of all solutions, Comput. Chem. Eng., 23 (1999), S963-S973. doi: 10.1016/S0098-1354(99)80231-2
|
| [43] |
C. Wang, R. Luo, K. Wu, B. Han, A new filled function method for an unconstrained nonlinear equation, J. Comput. Appl. Math., 235 (2011), 1689-1699. doi: 10.1016/j.cam.2010.09.010
|
| [44] |
I. Z. Emiris, B. Mourrain, Computer algebra methods for studying and computing molecular conformations, Algorithmica, 25 (1999), 372-402. doi: 10.1007/PL00008283
|
| [45] |
W. Gong, Y. Wang, Z. Cai, S. Yang, A weighted biobjective transformation technique for locating multiple optimal solutions of nonlinear equation systems, IEEE Trans. Evol. Comput., 21 (2017), 697-713. doi: 10.1109/TEVC.2017.2670779
|
| [46] |
W. He, W. Gong, L. Wang, X. Yan, C. Hu, Fuzzy neighborhood-based differential evolution with orientation for nonlinear equation systems, Knowl.-Based Syst., 182 (2019), 104796. doi: 10.1016/j.knosys.2019.06.004
|
| [47] |
R. Cheng, M. Li, K. Li, X. Yao, Evolutionary multiobjective optimization-based multimodal optimization: Fitness landscape approximation and peak detection, IEEE Trans. Evol. Comput., 22 (2018), 692-706. doi: 10.1109/TEVC.2017.2744328
|
| [48] |
N. Hansen, S. D. Müller, P. Koumoutsakos, Reducing the time complexity of the derandomized evolution strategy with covariance matrix adaptation (CMA-ES), Evol. Comput., 11 (2003), 1-18. doi: 10.1162/106365603321828970
|
| [49] | J. Pierezan, L. Coelho, Coyote optimization algorithm: A new metaheuristic for global optimization problems, in 2018 IEEE Congress on Evolutionary Computation (CEC), 2018. |
| [50] | C. W. LUO Y, Newton chaos iterative method and its application in electric machine, in Proceedings of the CSU-EPSA, 1 (2006). |
Qishuo Pang, Xianyan Mi, Jixuan Sun, Huayong Qin. Solving nonlinear equation systems via clustering-based adaptive speciation differential evolution[J]. Mathematical Biosciences and Engineering, 2021, 18(5): 6034-6065. doi: 10.3934/mbe.2021302
DownLoad:
