Ximing Liang

Learn More
As a novel evolutionary computation, cuckoo search (CS) algorithm has attracted much attention and wide applications, owing to its easy implementation. CS as most population-based algorithm is good at identifying promising area of the search space, but less good at fine-tuning the approximation to the minimization. To the best of our knowledge, the(More)
Facial expression recognition basically requires fast processing speed as well as quality classification results. In this paper, an approach is presented for such a facial expression recognition using Locally Constrained Support Vector Clustering (LCSVC) and neural network (NN). During feature extracting, the independent component analysis can not only(More)
Bath temperature and alumina concentration are two important but hard to measure online parameters of aluminum reduction cell. To this problem, a novel method based on least squares support vector machine (LS-SVM) and chaos optimization is proposed to establish predictive models of the two parameters. This method employs chaos optimization technique to(More)
Active set (AS) method suffers deteriorating performance and premature convergence when it is faced with a nonlinear programming problem (NLP) consisting of several inequality constraints. Thus, we propose an SQP/IPM algorithm that uses infeasible interior point method (IIPM) for solving quadratic programming (QP) subproblems. In this approach inequality(More)
The field of constrained nonlinear programming (NLP) has been principally challenging to various gradient based optimization techniques. The sequential quadratic programming algorithm (SQP) that uses active set strategy in solving quadratic programming (QP) subproblems proves to be efficient in locating the points of local optima. However, its efficient(More)
The field of constrained nonlinear programming (NLP) has been principally challenging to various gradient based optimization techniques. The Sequential quadratic programming algorithm (SQP) that uses active set strategy in solving quadratic programming (QP) subproblems proves to be efficient in locating the points of local optima. However, its efficient(More)
A decentralized control strategy for a robot swarm is presented, where each robot try to form a regular tetrahedron with its three neighbors. The proposed method is based on virtual spring and demands minimum local information. Four neighboring robots can form a regular tetrahedron formation regardless of their initial positions. A neighbor selection(More)