Convergence for a class of non-autonomous Nicholson’s blowflies model with time-varying coefficients and delays

This paper is concerned with a class of the generalized non-autonomous Nicholson’s blowflies model with time-varying coefficients and delays which is defined on the nonnegative function space. Under proper conditions, we employ a novel proof to establish some criteria to ensure that all solutions of this model converge to an equilibrium. Moreover, we give an example to illustrate our main result.     

On a generalization of Gross’s formula

We prove a relation between Whittaker functionals of cusp forms on ${{\widetilde{SL}}_2}$ and the toric periods of forms on the quaternion algebra. As an application we prove a generalization of a formula of Gross.     

Convergence of Pham Dinh–Le Thi’s algorithm for the trust-region subproblem

It is proved that any DCA sequence constructed by Pham Dinh–Le Thi’s algorithm for the trust-region subproblem (Pham Dinh and Le Thi, in SIAM J. Optim. 8:476–505, 1998) converges to a Karush–Kuhn–Tucker point of the problem. This result provides a complete solution for one open question raised by Le Thi et al. (J. Global Optim., Online First, doi:10.1007/s10898-011-9696-z, 2010).     

Nonlinear stochastic perturbations of dynamical systems and quasi-linear parabolic PDE’s with a small parameter

In this paper, we describe the asymptotic behavior, in the exponential time scale, of solutions to quasi-linear parabolic equations with a small parameter at the second order term and the long time behavior of corresponding diffusion processes. In particular, we discuss the exit problem and metastability for the processes corresponding to quasi-linear initial-boundary value problems.     

The moduli space of sheaves and a generalization of MacMahon’s formula

M. Vuletic has recently found a two-parameter generalization of MacMahon’s formula. In this paper we show that the coefficients in her formula are the Betti numbers of certain subvarieties in the moduli space of sheaves on the projective plane.     

Computing the topological entropy of continuous maps with at most three different kneading sequences with applications to Parrondo’s paradox

We introduce an algorithm to compute the topological entropy of piecewise monotone maps with at most three different kneading sequences, with prescribed accuracy. As an application, we compute the topological entropy of 3-periodic sequences of logistic maps, disproving a commutativity formula for topological entropy with three maps, and analyzing the dynamics Parrondo’s paradox in this setting.     

An efficient Levenberg–Marquardt method with a new LM parameter for systems of nonlinear equations

A modified Levenberg–Marquardt method for solving singular systems of nonlinear equations was proposed by Fan [J Comput Appl Math. 2003;21;625–636]. Using trust region techniques, the global and quadratic convergence of the method were proved. In this paper, to improve this method, we decide to introduce a new Levenberg–Marquardt parameter while also incorporate a new nonmonotone technique to this method. The global and quadratic convergence of the new method is proved under the local error bound condition. Numerical results show the new algorithm is efficient and promising.     

On a generalization of Kronecker’s limit formula

In this paper, we first generalize the Kronecker limit formula for a class of Epstein zeta functions using new approximation formulas. This enables us to derive some applications to the class number of quadratic imaginary number fields K and the period ratios of elliptic curves with complex multiplication.     

On the efficiency of two variants of Kurchatov’s method for solving nonlinear systems

We consider Kurchatov’smethod and construct two variants of this method for solving systems of nonlinear equations and deduce their local R-orders of convergence in a direct symbolic computation. We also propose a generalization to several variables of the efficiency used in the scalar case and analyse the efficiencies of the three methods when they are used to solve systems of nonlinear equations.     

Iterated local search with Powell’s method: a memetic algorithm for continuous global optimization

In combinatorial solution spaces Iterated Local Search (ILS) turns out to be exceptionally successful. The question arises: is ILS also capable of improving the optimization process in continuous solution spaces? To demonstrate that hybridization leads to powerful techniques in continuous domains, we introduce a hybrid meta-heuristic that integrates Powell’s direct search method. It combines direct search with elements from population based evolutionary optimization. The approach is analyzed experimentally on a set of well known test problems and compared to a state-of-the-art technique, i.e., a restart variant of the Covariance Matrix Adaptation Evolution Strategy with increasing population sizes (G-CMA-ES). It turns out that the population-based Powell-ILS is competitive to the CMA-ES, in some cases even significantly faster and behaves more robust than the pure strategy of Powell in multimodal fitness landscapes. Further experiments on the perturbation mechanism, population sizes, and problems with noise complete the analysis of the hybrid methodology and lead to parameter recommendations.     

A new proof of a generalization of Gerzon’s bound

Periodica Mathematica Hungarica - In this paper we give a short, new proof of a natural generalization of Gerzon’s bound. This bound improves the Delsarte, Goethals and Seidel’s upper...     

A generalization of Fulton’s conjecture for arbitrary groups

We prove a generalization of Fulton??s conjecture which relates intersection theory on an arbitrary flag variety to invariant theory.     

A generalization of a converse to Schur’s theorem

Niroomand (Arch. Math. 94 (2010) 401–404) proved a converse to a theorem of Schur in the following sense. He proved that if G is a group such that [G, G] is finite and G/Z(G) is finitely generated, then G/Z(G) is finite, of order bounded above by [G, G] ^k where k is the minimal number of generators required for G/Z(G). Here, we give a completely elementary short proof of a further generalization.