A polynomial complexity bound is established for an interior point path following algorithm for the monotone linear complementarity problem that is based on the Chen{Harker{Kanzow smoothing techniques. The fundamental diierence with the Chen{Harker and Kanzow algorithms is the introduction of a rescaled Newton direction. The rescaling requires the iterates to remain in the interior of the posit...

We present an implementation of an interior point algorithm for solving a special QCQP that can be used for determining the search direction in bundle methods for nonlinearly constrained nonsmooth optimization.

This paper presented a new two-stage green supply chain network, in which includes two innovations. Firstly, it presents a new multi-objective model for a two-stage green supply chain problem that considers the amount o...

today, with rapid growth of the world wide web and creation of internet sites and online text resources, text summarization issue is highly attended by various researchers. extractive-based text summarization is an important summarization method which is included of selecting the top representative sentences from the input document. when, we are facing into large data volume documents, the extr...

this paper presents a strategy for using harmony search algorithm in facility layout optimization problems. in this paper an adapted harmony search algorithm is developed for solving facility layout optimization problems. this method finds an optimal facility arrangement in an existing layout. two real-world case studies are employed to demonstrate the efficiency of this model. a comparison is ...

We analyse the scaling matrix, search direction, and neighbourhood used in MOSEK's algorithm for nonsymmetric conic optimization [J. Dahl E.D. Andersen, A primal-dual interior-point f...

the cuckoo search algorithm is a recently developedmeta-heuristic optimization algorithm, which is suitable forsolving optimization problems. to enhance the accuracy andconvergence rate of this algorithm, an improved cuckoo searchalgorithm is proposed in this paper. normally, the parametersof the cuckoo search are kept constant. this may lead todecreasing the efficiency of the algorithm. to cop...

in this paper, we present a new path-following interior-point algorithm for -horizontal linear complementarity problems (hlcps). the algorithm uses only full-newton steps which has the advantage that no line searchs are needed. moreover, we obtain the currently best known iteration bound for the algorithm with small-update method, namely, , which is as good as the linear analogue.

A methodology is proposed for optimal shaping of permanent magnets with non-conventional and complex geometries, used in synchronous motors. The algorithm includes artificial neural network-based surrogate model and multi-objective search based optimization method that will lead to Pareto front solutions. An interior permanent magnet topology with crescent-shaped magnets is also introduced as t...

The interior trust region algorithm for convex quadratic programming is further developed. This development is motivated by the barrier function and the \center" path-following methods, which create a sequence of primal and dual interior feasible points converging to the optimal solution. At each iteration, the gap between the primal and dual objective values (or the complementary slackness val...