‎in this paper‎, ‎we propose a feasible interior-point method for‎ ‎convex quadratic programming over symmetric cones‎. ‎the proposed algorithm relaxes the‎ ‎accuracy requirements in the solution of the newton equation system‎, ‎by using an inexact newton direction‎. ‎furthermore‎, ‎we obtain an‎ ‎acceptable level of error in the inexact algorithm on convex‎ ‎quadratic symmetric cone programmin...

Currently, the research of emergency supplies distribution and decision models mostly focus on deterministic models and exact algorithm. A few of studies have been done on the multi-level distribution network and matheuristic algorithm. In this paper, random processes theory is adopted to establish emergency supplies distribution and decision model for multi-level network. By analyzing the char...

The artificial fish swarm algorithm (AFSA) is a heuristic global optimization technique based on population which is easy to understand, good robustness, and not insensitive to initial values. The behavior of fishes has a great impact on the performance of the algorithm, such as global search and convergence speed. At present, there has no general research theory to select behaviors of fishes. ...

Due to the complex structural issues and increasing number of design variables, a rather fast optimization algorithm to lead to a global swift convergence history without multiple attempts may be of major concern. Genetic Algorithm (GA) includes random numerical technique that is inspired by nature and is used to solve optimization problems. In this study, a novel GA method based on self-a...

Pierre Teilhard de Chardin, as he is more commonly known, was a Jesuit priest who died in 1955, having worked for some twenty years as a paleontologist in China. While being a renowned scientist, who assisted in the finding of the Peking Man fossil, Teilhard’s main desire and scholastic efforts were to reshape modern Christian theology in the light of contemporary science, especially in his own...

Recently developed, second-order sliding-mode control (2-SMC) algorithms are analyzed to assess their global convergence properties. While standard first-order sliding-mode control (1-SMC) algorithms derive their effectiveness from the global solution of the well known “reaching condition” _ ( = 0 being the actual sliding manifold), 2-SMC is based on more complex differential inequalities, for ...

Many academics have questioned the thesis (most prominently associated with Osborne and Gaebler’s Re-inventing government) that there is an inevitable and global convergence towards a particular, new style of public management. Yet, despite the ongoing production of scholarly evidence of global diversity, pronouncements of convergence continue to be made by politicians, civil servants and some ...

A well-known clustering algorithm is K-means. This algorithm, besides advantages such as high speed and ease of employment, suffers from the problem of local optima. In order to overcome this problem, a lot of studies have been done in clustering. This paper presents a hybrid Extended Cuckoo Optimization Algorithm (ECOA) and K-means (K), which is called ECOA-K. The COA algorithm has advantages ...

Estimate of exponential convergence rate and exponential stability are studied for a class of neural networks which includes the Hopfield neural networks and the cellular neural networks. Both local and global exponential convergence is discussed. Theorems for estimate of exponential convergence rate are established and the bounds on the rate of convergence are given. The domains of attraction ...