Open Access. Powered by Scholars. Published by Universities.®
Operations Research, Systems Engineering and Industrial Engineering Commons™
Open Access. Powered by Scholars. Published by Universities.®
- Discipline
- Publication
- Publication Type
Articles 1 - 4 of 4
Full-Text Articles in Operations Research, Systems Engineering and Industrial Engineering
Multi-Objective Optimization Algorithm Based On Multi-Index Elite Individual Game Mechanism, Xu Wang, Weidong Ji, Guohui Zhou, Jiahui Yang
Multi-Objective Optimization Algorithm Based On Multi-Index Elite Individual Game Mechanism, Xu Wang, Weidong Ji, Guohui Zhou, Jiahui Yang
Journal of System Simulation
Abstract: In order to improve the convergence of multi-objective optimization algorithm and the diversity of optimization solution set, and alleviate the flown down of population in target space, a multi-objective optimization algorithm based on multi-attribute elite individual game mechanism is proposed. This paper uses Pareto dominance relationship and multi-index to comprehensively screen elite individuals. The elite individual game mechanism with K-means clustering is integrated with cross and mutation strategy, which effectively improves the convergence and diversity of the algorithm. A detailed convergence analysis of the algorithm is performed to prove the convergence of the algorithm. Eight representative comparison algorithms are …
Kernel Block Diagonal Representation Subspace Clustering And Its Convergence Analysis, Maoshan Liu, Zhicheng Ji, Wang Yan, Jianfeng Wang
Kernel Block Diagonal Representation Subspace Clustering And Its Convergence Analysis, Maoshan Liu, Zhicheng Ji, Wang Yan, Jianfeng Wang
Journal of System Simulation
Abstract: Focus on the problems that the linear block diagonal representation subspace clustering cannot effectively handle non-linear visual data, and the regular regularizers cannot directly pursue the k-block diagonal matrix, a kernel block diagonal representation subspace clustering is proposed. In the proposed algorithm, the original input space is mapped into the kernel Hilbert space which is linearly separable, and the spectral clustering is performed in the feature space. The convergence analysis is given, and the strong convex of variables and the boundedness of function is utilized to verify the monotonically decreasing of objective function and the boundedness and convergence of …
Multi Self-Adapting Particle Swarm Optimization Algorithm (Msapso)., Gerhard Koch
Multi Self-Adapting Particle Swarm Optimization Algorithm (Msapso)., Gerhard Koch
Electronic Theses and Dissertations
The performance and stability of the Particle Swarm Optimization algorithm depends on parameters that are typically tuned manually or adapted based on knowledge from empirical parameter studies. Such parameter selection is ineffectual when faced with a broad range of problem types, which often hinders the adoption of PSO to real world problems. This dissertation develops a dynamic self-optimization approach for the respective parameters (inertia weight, social and cognition). The effects of self-adaption for the optimal balance between superior performance (convergence) and the robustness (divergence) of the algorithm with regard to both simple and complex benchmark functions is investigated. This work …
On Convergence Analysis Of Dual Proximal-Gradient Methods With Approximate Gradient For A Class Of Nonsmooth Convex Minimization Problems, Sanming Liu, Zhijie Wang, Chongyang Liu
On Convergence Analysis Of Dual Proximal-Gradient Methods With Approximate Gradient For A Class Of Nonsmooth Convex Minimization Problems, Sanming Liu, Zhijie Wang, Chongyang Liu
Chongyang Liu
In this paper, we consider the problem of minimizing a nonsmooth convex objective which is the sum of a proper, nonsmooth, closed, strongly convex extend real-valued function with a proper, nonsmooth, closed, convex extend real-valued function.