Related papers: Smallest Enclosing Sphere in 3D -- Particle Swarm …
In this paper, we present an improved approximation algorithm for three related problems. In the Minimum Sum of Radii clustering problem (MSR), we aim to select $k$ balls in a metric space to cover all points while minimizing the sum of the…
In this work, we deal with rank-constrained integer least-squares optimization problems arising in low-rank matrix factorization related applications. We propose a solution for constrained integer least-squares problem subject to equality,…
Particle swarm optimization comes under lot of changes after James Kennedy and Russell Eberhart first proposes the idea in 1995. The changes has been done mainly on Inertia parameters in velocity updating equation so that the convergence…
We present a reduced-dimension, ballistic deposition, Monte Carlo particle packing algorithm and discuss its application to the analysis of the microstructure of hard-sphere systems with broad particle size distributions. We extend our…
Model merging has emerged as an efficient strategy for constructing multitask models by integrating the strengths of multiple available expert models, thereby reducing the need to fine-tune a pre-trained model for all the tasks from…
In this paper, based on the Quantum-behaved Particle Swarm Optimization algorithm, we evolve the algorithm to optimize a multiobjective optimization problem, namely the Cobb Douglas Habitability function which is based on CES production…
Optimisation problems are ubiquitous in particle and astrophysics, and involve locating the optimum of a complicated function of many parameters that may be computationally expensive to evaluate. We describe a number of global optimisation…
The dynamic of real-world optimization problems raises new challenges to the traditional particle swarm optimization (PSO). Responding to these challenges, the dynamic optimization has received considerable attention over the past decade.…
Determination of \emph{optimal} arrangements of $N$ particles on a sphere is a well-known problem in physics. A famous example of such is the Thomson problem of finding equilibrium configurations of electrical charges on a sphere. More…
In many real-world problems, we are dealing with collections of high-dimensional data, such as images, videos, text and web documents, DNA microarray data, and more. Often, high-dimensional data lie close to low-dimensional structures…
In this paper we consider a continuous description based on stochastic differential equations of the popular particle swarm optimization (PSO) process for solving global optimization problems and derive in the large particle limit the…
In [1], the author considered the problem of the optimal approximation of symmetric surfaces by biquadratic B\'ezier patches. Unfortunately, the results therein are incorrect, which is shown in this paper by considering the optimal…
Many real-world problems are dynamic optimization problems. In this case, the optima in the environment change dynamically. Therefore, traditional optimization algorithms disable to track and find optima. In this paper, a new multi-swarm…
During the last few years several new results on packing problems were obtained using a blend of tools from semidefinite optimization, polynomial optimization, and harmonic analysis. We survey some of these results and the techniques…
Two widely used randomized algorithms are the sketch-and-solve method for least-squares regression and the randomized SVD for low-rank approximation. These algorithms apply a random embedding to compress a target matrix, and they perform…
Balanced circular bin packing problems consist in positioning a given number of weighted circles in order to minimize the radius of a circular container while satisfying equilibrium constraints. These problems are NP-hard, highly…
A distributed spiral algorithm for distributed optimization in WSN is proposed. By forming a spiral-shape message passing scheme among clusters, without loss of estimation accuracy and convergence speed, the algorithm is proved to converge…
Statistical evidence of the influence of neighborhood topology on the performance of particle swarm optimization (PSO) algorithms has been shown in many works. However, little has been done about the implications could have the percolation…
Given a set of $n$ points in the plane, and a parameter $k$, we consider the problem of computing the minimum (perimeter or area) axis-aligned rectangle enclosing $k$ points. We present the first near quadratic time algorithm for this…
A sphere is a fundamental geometric object widely used in (computer aided) geometric design. It possesses rational parameterizations but no parametric polynomial parameterization exists. The present study provides an approach to the optimal…