The Artificial Bee Colony (ABC) algorithm is one of the most recent swarm intelligence based algorithms which simulates the foraging behavior of honey bee colonies. In this work, a particle swarm inspired multi-elitist ABC algorithm named PS-MEABC is proposed and applied for real-parameter...

Piecewise linear-quadratic (PLQ) functions are an important class of functions in convex analysis since the result of most convex operators applied to a PLQ function is a PLQ function. We modify a recent algorithm for computing the convex (Legendre-Fenchel) conjugate of convex PLQ functions of...

This paper addresses a network pricing problem where users are assigned to the paths of a transportation network according to a mixed logit model, i.e., price sensitivity varies across the user population. For its solution, we propose algorithms based on combinatorial approximations, and show...

In this paper, we propose a structured trust-region algorithm combining with filter technique to minimize the sum of two general functions with general constraints. Specifically, the new iterates are generated in the Gauss-Seidel type iterative procedure, whose sizes are controlled by a...

The problem of finding the best rank-one approximation to higher-order tensors has extensive engineering and statistical applications. It is well-known that this problem is equivalent to a homogeneous polynomial optimization problem. In this paper, we study theoretical results and numerical...

Many researchers have used Oneshot optimization methods based on user-specified primal state iterations, the corresponding adjoint iterations, and appropriately preconditioned design steps. Our goal here is to develop heuristics for sequencing these three subtasks, in order to optimize the...

The present paper is concerned with the semilocal convergence problems of Halley’s method for solving nonlinear operator equation in Banach space. Under some so-called majorant conditions, a new semilocal convergence analysis for Halley’s method is presented. This analysis enables us to drop...

The optimization of three problems with high dimensionality and many local minima are investigated under five different optimization algorithms: DIRECT, simulated annealing, Spall’s SPSA algorithm, the KNITRO package, and QNSTOP, a new algorithm developed at Indiana University. Copyright...

In this paper, we consider block-decomposition first-order methods for solving large-scale conic semidefinite programming problems given in standard form. Several ingredients are introduced to speed-up the method in its pure form such as: an aggressive choice of stepsize for performing the...

Evolutionary Algorithms (EAs) are emerging as competitive and reliable techniques for several optimization tasks. Juxtapositioning their higher-level and implicit correspondence; it is provocative to query if one optimization algorithm can benefit from another by studying underlying similarities...