1.1k citations
- Xi'an Jiaotong UniversityCN17 papers
- Middlesex University LondonGB8 papers
- Guangzhou UniversityCN5 papers
- Northwestern Polytechnical UniversityCN3 papers
- Xi'an University of Finance and EconomicsCN3 papers
- Capital Normal UniversityCN2 papers
- Harbin Engineering UniversityCN2 papers
- Shaanxi Normal UniversityCN2 papers
- Sichuan UniversityCN2 papers
- Advanced Network and Services (United States)US1 paper
- Baidu (China)CN1 paper
- Beijing Computational Science Research CenterCN1 paper
8 papers · 1 filter
The Global Convergence Analysis of the Bat Algorithm Using a Markovian Framework and Dynamical System Theory
Si Chen, Guo-Hua Peng, Xing-Shi He +1
The bat algorithm (BA) has been shown to be effective to solve a wider range of optimization problems. However, there is not much theoretical analysis concerning its convergence an…
Iterative thresholding algorithm based on non-convex method for modified lp-norm regularization minimization
Angang Cui, Jigen Peng, Haiyang Li +2
Recently, the -norm regularization minimization problem has attracted great attention in compressed sensing. However, the -norm in problem…
Global Convergence Analysis of the Flower Pollination Algorithm: A Discrete-Time Markov Chain Approach
Xingshi He, Xin-She Yang, Mehmet Karamanoglu +1
Flower pollination algorithm is a recent metaheuristic algorithm for solving nonlinear global optimization problems. The algorithm has also been extended to solve multiobjective op…
Generalized singular value thresholding operator to affine matrix rank minimization problem
Angang Cui, Haiyang Li, Jigen Peng +1
It is well known that the affine matrix rank minimization problem is NP-hard and all known algorithms for exactly solving it are doubly exponential in theory and in practice due to…
Exact recovery low-rank matrix via transformed affine matrix rank minimization
Angang Cui, Jigen Peng, Haiyang Li
The goal of affine matrix rank minimization problem is to reconstruct a low-rank or approximately low-rank matrix under linear constraints. In general, this problem is combinatoria…
Affine matrix rank minimization problem via non-convex fraction function penalty
Angang Cui, Jigen Peng, Haiyang Li +2
Affine matrix rank minimization problem is a fundamental problem with a lot of important applications in many fields. It is well known that this problem is combinatorial and NP-har…