In this paper, a Cuckoo Search Algorithm (CSA) is proposed for solving environmental economic load dispatch (EELD) problem with quadratic fuel function. Cuckoo Search is a new meta-heuristic algorithm inspired from the obligate brood parasitism of some cuckoo species by laying their eggs in the nests of other host birds of other species for solving optimization problems with promising results. ...

In this paper, based on the regularization techniques and projected gradient strategies, we present a quadratic regularization projected alternating Barzilai–Borwein (QRPABB) method for minimizing differentiable functions on closed convex sets. We show the convergence of the QRPABB method to a constrained stationary point for a nonmonotone line search. When the objective function is convex, we ...

Three approaches are currently used for devising identity-based encryption schemes. They build on pairings, quadratic residues (QR), and lattices, respectively. Among them, the QR-based scheme proposed by Cocks in 2001 is notable in that it works in standard RSA groups: its security relies on the standard quadratic residuosity assumption. But is has also a number of deficiencies, some of them h...

We consider convex quadratic programming problem with convex quadratic constraints and suggest a modification of the well-known ellipsoid method based on using an ellipsoidal layer in the problem of circumscribing the minimum volume ellipsoid around of a part of a given ellipsoid. Our paper contains further development and improvement of the technique previously developed in [E.G88]. We show ho...

We present in this paper several results concerning a simple model of interaction between an inviscid fluid, modeled by the Burgers equation, and a particle, assumed to be point-wise. It is composed by a first-order partial differential equation which involves a singular source term and by an ordinary differential equation. Though this model can be considered simple, its mathematical analysis i...

We will assume that the twisted L-series are primitive (i.e. the corresponding twisted modular forms are newforms). There is no loss of generality in making this assumption: if this is not the case, then f would be a quadratic twist of a newform of smaller level, which we can choose instead. The question of efficiently computing the family of central values L(f,D, 1), for fundamental discrimina...

This paper presents a computationally e cient algorithm for function approximation with piecewise linear sigmoidal nodes A one hidden layer network is constructed one node at a time using the well known method of tting the residual The task of tting an individual node is accom plished using a new algorithm that searches for the best t by solving a sequence of Quadratic Programming problems This...

The method of shortest residuals (SR) was presented by Hestenes and studied by Pitlak. If the function is quadratic, and if the line search is exact, then the SR method reduces to the linear conjugate gradient method. In this paper, we put forward the formulation of the SR method when the line search is inexact. We prove that, if stepsizes satisfy the strong Wolfe conditions, both the Fletcher-...

In this paper, we propose an effective microaggregation algorithm to produce a more useful protected data for publishing. Microaggregation is mapped to a clustering problem with known minimum and maximum group size constraints. In this scheme, the goal is to cluster n records into groups of at least k and at most 2k_1 records, such that the sum of the within-group squ...

k is a continuously differentiable function, bounded from below, two main approaches are operational to date. The first one is based on the line-search concept which assures the global convergence of the methods. The idea is to use a quadratic model in order to generate a search direction and then find a suitable stepsize along the direction. Although it is successful at most time it does not u...