An implementable proximal point algorithm is established for the smooth nonconvex unconstrained minimization problem. At each iteration, the algorithm minimizes approximately a general quadratic by a truncated strategy with step length control. The main contributions are: (i) a framework for updating the proximal parameter; (ii) inexact criteria for approximately solving the subproblems; (iii) ...

A Gaussian correction scheme is proposed and a G-PSO algorithm is proposed. Through the introduction of Gaussian coefficients, we modify the fitness function of PSO algorithm, the particle individual velocity and the position updating strategy. Furthermore, two test functions are used to analyze the performance of G-PSO algorithm to solve the global optimal solution. Experimental results of vir...

We investigate the spatiotemporal dynamics of coupled circle map lattices, evolving under synchronous (parallel) updating on one hand and asynchronous (random) updating rules on the other. Synchronous evolution of extended spatiotemporal systems, such as coupled circle map lattices, commonly yields multiple co-existing attractors, giving rise to phenomena strongly dependent on the initial latti...

A β-skeleton is a proximity undirected graph whose connectivity is determined by the parameter β . We study β-skeleton automata where every node is a finite state machine taking two states, and updating its states depending on the states of adjacent automata-nodes. We allow automata-nodes to remember their previous states. In computational experiments we study how memory affects the global spac...

This paper presents a model of a discrete-time recurrent neural network designed to perform quadratic real optimization with bound constraints. The network iteratively improves the estimate of the solution, always maintaining it inside of the feasible region. Several neuron updating rules which assure global convergence of the net to the desired minimum have been obtained. Some of them also ass...

This paper proposes a formulation of the basic ideas of dynamic semantics in terms of the state monad. Such a monadic treatment allows to specify meanings as computations that clearly separate context updating and context accessing operations from purely truth conditional meaning composition. Different behavior regarding the availability of referents throughout a discourse is modelled by adding...

In this paper, we propose a new updating rule of the LevenbergMarquardt (LM) parameter for the LM method for nonlinear equations. We show that the global complexity bound of the new LM algorithm is O( −2), that is, it requires at most O( −2) iterations to derive the norm of the gradient of the merit function below the desired accuracy . Host: Jiawang Nie Wednesday, November 1, 2017 4:00 PM AP&M...

In this paper, we present a detail study about the immunization of viruses in Peer-to-Peer networks exhibiting power-law degree distributions. By comparing two different immunization strategies (randomized and degree-based), we conclude that it is efficient to immunize the highly connected nodes in order to eradicate viruses from the network. Furthermore, we propose an efficient updating algori...