Simulated annealing is a widely used algorithm for the computation of global optimization problems in computational chemistry and industrial engineering. However, global optimum values cannot always be reached by simulated annealing without a logarithmic cooling schedule. In this study, we propose a new stochastic optimization algorithm, i.e., simulated annealing based on the multiple-try Metropolis method, which combines simulated annealing and the multiple-try Metropolis algorithm. The proposed algorithm functions with a rapidly decreasing schedule, while guaranteeing global optimum values. Simulated and real data experiments including a mixture normal model and nonlinear Bayesian model indicate that the proposed algorithm can significantly outperform other approximated algorithms, including simulated annealing and the quasi-Newton method.
The C-eigenpair of piezoelectric tensors finds applications in the area of the piezoelectric effect and converse piezoelectric effect. In this paper, we provide some characterizations of C-eigenvectors by exploring the structure of piezoelectric tensors, and establish sharp C-eigenvalue inclusion intervals via Cauchy–Schwartz inequality. Further, we propose the lower and upper bounds of the largest C-eigenvalue and evaluate the efficiency of the best rank-one approximation of piezoelectric tensors. Numerical examples are proposed to verify the efficiency of the obtained results.
31 December 2021 in Mathematical Problems in Engineering
Simplicial depth (SD) plays an important role in discriminant analysis, hypothesis testing, machine learning, and engineering computations. However, the computation of simplicial depth is hugely challenging because the exact algorithm is an NP problem with dimension and sample size as input arguments. The approximate algorithm for simplicial depth computation has extremely low efficiency, especially in high-dimensional cases. In this study, we design an importance sampling algorithm for the computation of simplicial depth. As an advanced Monte Carlo method, the proposed algorithm outperforms other approximate and exact algorithms in accuracy and efficiency, as shown by simulated and real data experiments. Furthermore, we illustrate the robustness of simplicial depth in regression analysis through a concrete physical data experiment.
Many statistical problems can be formulated as the missing data problems. The data augmentation algorithm and the inverse Bayes formula are important tools for constructing iterative optimization or samplings via the introduction of unobserved data or latent variables. As a Markov Chain Monte Carlo method, the data augmentation algorithm has its autocorrelation. Nevertheless, the convergence rate of the data augmentation algorithm is not known in the Genetic Linkage Model, and the same is true for the inverse Bayes formula method. In this article, we analyze the convergence rates of the data augmentation algorithm and the inverse Bayes formula method in the genetic linkage model, and through simulation results we get their convergence rates.
Although many methods have been developed to do haplotype inference, it is still a challenge work to infer haplotypes and their frequencies from the genotypes data, which are generally obtained at the present time. In this paper, we introduce a penalized method which performs better than the former used way to do the inference. Furthermore, we still use the software HAPLORE, which consist the following three steps, to identify all the compatible haplotypes from the genotypes. Finally, we test the accuracy of the penalized method, and have a comparison with the traditional way. Our simulation results show that the penalized method has more efficiency and accuracy.