نتایج جستجو برای: quadratic optimization
تعداد نتایج: 358632 فیلتر نتایج به سال:
Particle swarm optimization is used in several combinatorial optimization problems. In this work, particle swarms are used to solve quadratic programming problems with quadratic constraints. The approach of particle swarms is an example for interior point methods in optimization as an iterative technique. This approach is novel and deals with classification problems without the use of a traditi...
The Antlion Optimization (ALO) algorithm is a meta-heuristic optimization based on the hunting of ants by antlions. basic inadequacy this that it has long run time because random walk model used for ant's movement. We improved some mechanisms in ALO algorithm, such as ants' walking, reproduction, sliding towards antlion, elitism, and selection procedure. This proposed called Improved (IALO) alg...
We propose a novel Rayleigh quotient based sparse quadratic dimension reduction method—named QUADRO (Quadratic Dimension Reduction via Rayleigh Optimization)—for analyzing high-dimensional data. Unlike in the linear setting where Rayleigh quotient optimization coincides with classification, these two problems are very different under nonlinear settings. In this paper, we clarify this difference...
there are many approaches for solving variety combinatorial optimization problems (np-compelete) that devided to exact solutions and approximate solutions. exact methods can only be used for very small size instances due to their expontional search space. for real-world problems, we have to employ approximate methods such as evolutionary algorithms (eas) that find a near-optimal solution in a r...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید