The global Hessenberg and CMRH methods for linear systems with multiple right-hand sides

In this paper, we introduce two new methods for solving large sparse nonsymmetric linear systems with several right-hand sides. These methods are the global Hessenberg and global CMRH methods. Using the global Hessenberg process, these methods are less expensive than the global FOM and global GMRES methods [9]. Theoretical results about the new methods are given, and experimental results that show good performances of these new methods are presented.     

变时滞Hopfield神经网络的全局吸引性和全局指数稳定性

对一类具时滞的Hopfeild型神经网络模型,在非线性神经元激励函数只要求满足Lipschitz连续的条件下,利用推广的Halanay时延微分析不等式、Dini导数以及泛函微分析技术,给出了这类模型的平衡点全局指数稳定性和全局吸引性的充分条件,这些条件易于检验,且改进和推广了前人的结论.此外,此文给出了研究神经网络模型的全局吸引性的微分不等式比较方法.     

时滞Hopfield神经网络模型的全局吸引性和全局指数稳定性

对具有时滞的Hopfield神经网络模型,在非线性神经元激励函数是Lipschitz连续(而非已有的大部分文献中假设是Sigmoid函数)的条件下,通过构造适当的泛函,给出了这类模型全局吸引和平衡点全局指数稳定的易于验证的充分条件。     

Convergence properties of materially and geometrically non-linear finite-element spatial beam analysis

The way the non-linear constitutive equations in the spatial beam formulations are solved, influences the rate of convergence and the computational cost. Three different approaches are studied: (i) the direct global approach, where the constitutive equations are taken to be the iterative part of the global governing equations, (ii) the local (or indirect global) approach, where the constitutive equations are solved separately in each step of the global iteration, and (iii) the partly reduced approach, which is the combination of (i) and (ii). The approaches are compared with regard to the number of global iterations and the total number of floating point operations. The direct global approach is found to be the best choice.     

Bayesian approach to global optimization and application to multiobjective and constrained problems

In this paper, the Bayesian methods of global optimization are considered. They provide the minimal expected deviation from the global minimum. It is shown that, using the Bayesian methods, the asymptotic density of calculations of the objective function is much greater around the point of global minimum. The relation of this density to the parameters of the method and to the function is defined.Algorithms are described which apply the Bayesian methods to problems with linear and nonlinear constraints. The Bayesian approach to global multiobjective optimization is defined. Interactive procedures and reduction of multidimensional data in the case of global optimization are discussed.     

Stochastic Global Optimization: Problem Classes and Solution Techniques

There is a lack of a representative set of test problems for comparing global optimization methods. To remedy this a classification of essentially unconstrained global optimization problems into unimodal, easy, moderately difficult, and difficult problems is proposed. The problem features giving this classification are the chance to miss the region of attraction of the global minimum, embeddedness of the global minimum, and the number of minimizers. The classification of some often used test problems are given and it is recognized that most of them are easy and some even unimodal. Global optimization solution techniques treated are global, local, and adaptive search and their use for tackling different classes of problems is discussed. The problem of fair comparison of methods is then adressed. Further possible components of a general global optimization tool based on the problem classes and solution techniques is presented.     

Global Weyl modules for the twisted loop algebra

We define global Weyl modules for twisted loop algebras and analyze their highest weight spaces, which are in fact isomorphic to Laurent polynomial rings in finitely many variables. We are able to show that the global Weyl module is a free module of finite rank over these rings. Furthermore we prove, that there exist injective maps from the global Weyl modules for twisted loop algebras into a direct sum of global Weyl modules for untwisted loop algebras. Relations between local Weyl modules for twisted and untwisted generalized current algebras are known; we provide for the first time a relation on global Weyl modules.     

Global optimality conditions and optimization methods for quadratic assignment problems

In this paper some global optimality conditions for general quadratic {0, 1} programming problems with linear equality constraints are discussed and then some global optimality conditions for quadratic assignment problems (QAP) are presented. A local optimization method for (QAP) is derived according to the necessary global optimality conditions. A global optimization method for (QAP) is presented by combining the sufficient global optimality conditions, the local optimization method and some auxiliary functions. Some numerical examples are given to illustrate the efficiency of the given optimization methods.     

An Approach to Finding a Global Minimization with Equality and Inequality Constraints

We give an approach for finding a global minimization with equality and inequality Constraints.Our approach is to construct an exact penalty function, and prove that the global minimal points of this exact penalty function are the primal constrained global minimal points. Thus we convert the problem of global constrained optimization into a problem of global unconstrained optimization. Furthermore, the integral approach for finding a global minimization for a class of discontinuous functions is used and an implementable algorithm is given.     

Brauer-Thrall Type Theorems for Derived Module Categories

The numerical invariants (global) cohomological length, (global) cohomological width, and (global) cohomological range of a complex (an algebra) are introduced. Cohomological range leads to the concepts of derived bounded algebra and strongly derived unbounded algebra naturally. The first and second Brauer-Thrall type theorems for the bounded derived category of a finite-dimensional algebra over an algebraically closed field are obtained. The first Brauer-Thrall type theorem says that derived bounded algebras are just derived finite algebras. The second Brauer-Thrall type theorem says that an algebra is either derived discrete or strongly derived unbounded, but not both. Moreover, piecewise hereditary algebras and derived discrete algebras are characterized as the algebras of finite global cohomological width and the algebras of finite global cohomological length respectively.     

A Lagrangean based branch-and-cut algorithm for global optimization of nonconvex mixed-integer nonlinear programs with decomposable structures

In this work we present a global optimization algorithm for solving a class of large-scale nonconvex optimization models that have a decomposable structure. Such models, which are very expensive to solve to global optimality, are frequently encountered in two-stage stochastic programming problems, engineering design, and also in planning and scheduling. A generic formulation and reformulation of the decomposable models is given. We propose a specialized deterministic branch-and-cut algorithm to solve these models to global optimality, wherein bounds on the global optimum are obtained by solving convex relaxations of these models with certain cuts added to them in order to tighten the relaxations. These cuts are based on the solutions of the sub-problems obtained by applying Lagrangean decomposition to the original nonconvex model. Numerical examples are presented to illustrate the effectiveness of the proposed method compared to available commercial global optimization solvers that are based on branch and bound methods.     

Generalized global conjugate gradient squared algorithm

In this paper, a generalized global conjugate gradient squared method for solving nonsymmetric linear systems with multiple right-hand sides is presented. The method can be derived by using products of two nearby global BiCG polynomials and formal orthogonal polynomials, of which global CGS and global BiCGSTAB are just particular cases. We also show to apply the method for solving the Sylvester matrix equation. Finally, numerical examples are given to illustrate the effectiveness of the proposed method.     

Error Control in Polytope Computations

This paper presents solutions for numerical computation on convex hulls; computational algorithms that ensure logical consistency and accuracy are proposed. A complete numerical error analysis is presented. It is shown that a global error bound for vertex-facet adjacency does not exist under logically consistent procedures. To cope with practical requirements, vertex preconditioned polytope computations are introduced using point and hyperplane adjustments. A global bound on vertex-facet adjacency error is affected by the global bound on vertices; formulas are given for a conservative choice of global error bounds.     

Global Dependence Stochastic Orders

Two basic ideas, that give rise to global dependence stochastic orders, are introduced and studied. The similarities and differences between the resulting global dependence orders, and the known common positive dependence orders, are discussed. Some desirable properties that global dependence orders may expected to satisfy are listed and checked. Three particular global dependence orders, that come up from the two general ideas, are studied in detail. It is shown, among other things, how these orders can be verified. Finally, some applications in auction theory, in reliability theory, and in economics, are described.     

Global efficiency in multiobjective programming *

In this paper, we are concerned with global efficiency in multiobjective optimization. After exposing a property of a cone-subconvexlike function, we prove that a local weakly efficient solution, a local efficient solution and a local properly efficient solution are respectively a global weakly efficient solution, a global efficient solution and a global properly efficient solution of a multiobjective programming problem if cone- subconvexlikeness or cone-pre-invexity is assumed     

带状区域中渐近周期曲率流方程的整体解

该文研究了具有渐近周期系数的曲率流方程的Neumann边值问题.首先,考虑一列初值问题及其相应的全局解,通过一致的先验估计取一个收敛子列,得到其极限就是一个整体解的结论.其次,向负无穷时间方向进行重整化,使用强极值原理证明了整体解的唯一性.最后,为了研究整体解的ω-和α-极限,再次使用重整化方法,通过构造拉回函数、进行...     

Convergence guarantees for generalized adaptive stochastic search methods for continuous global optimization

This paper presents some simple technical conditions that guarantee the convergence of a general class of adaptive stochastic global optimization algorithms. By imposing some conditions on the probability distributions that generate the iterates, these stochastic algorithms can be shown to converge to the global optimum in a probabilistic sense. These results also apply to global optimization algorithms that combine local and global stochastic search strategies and also those algorithms that combine deterministic and stochastic search strategies. This makes the results applicable to a wide range of global optimization algorithms that are useful in practice. Moreover, this paper provides convergence conditions involving the conditional densities of the random vector iterates that are easy to verify in practice. It also provides some convergence conditions in the special case when the iterates are generated by elliptical distributions such as the multivariate Normal and Cauchy distributions. These results are then used to prove the convergence of some practical stochastic global optimization algorithms, including an evolutionary programming algorithm. In addition, this paper introduces the notion of a stochastic algorithm being probabilistically dense in the domain of the function and shows that, under simple assumptions, this is equivalent to seeing any point in the domain with probability 1. This, in turn, is equivalent to almost sure convergence to the global minimum. Finally, some simple results on convergence rates are also proved.     

基于偏最小二乘变换与Kriging模型的全局优化方法

针对传统Kriging模型在多变量(高维)输入全局优化中因超参数过多而引发收敛速度慢,精度低,建模效率不高问题,提出了基于偏最小二乘变换技术和Kriging模型的有效全局优化方法.首先,构造偏最小二乘高斯核函数;其次,借助差分进化算法寻找满足期望改进准则最大化条件的新样本点;然后,将不同核函数和期望改进准则组合,构建四种有效全局优化算法并进行比较;最后,数值算例结果表明,基于偏最小二乘变换的Kriging全局优化方法在解决高维全局优化问题方面相比于标准的全局优化算法在收敛精度及收敛速度方面更具优势.     

Stability and bifurcation in a two variable delay model for circadian rhythm of Neurospora crassa

A two variable delay model for circadian rhythm of Neurospora crassa is considered in this paper. Conditions for the global attractivity of the unique positive equilibrium are given. Moreover, Hopf bifurcation and the global continuation of the Hopf bifurcation branches are addressed through a global Hopf bifurcation result.     

Global asymptotic stability analysis for integro-differential systems modeling neural networks with delays

In this paper, the global asymptotic stability of the equilibrium point of integro-differential systems modeling neural networks with time-varying delays are studied. Proper Lyapunov functionals and some analytic techniques are employed to derive the sufficient conditions under which the networks proposed are the global asymptotic stability. The results have shown to improve the previous global asymptotic stability results derived in the literature. Some examples are given to illustrate the correctness of our results.