环面上具有间断梯度的势函数的模拟退火

本文证明了环面上具有间断梯度的势函数的模拟退火过程：dXt=-VU(Xt)dt √2dWt概率收敛到势函数的全局极小集附近。     

Simulated annealing with a potential function with discontinuous gradient on Rd

In this paper, we have proven that the simulated annealing processdX _t = ?β(t) ?U (X _t ) + √2dW _tt with a potential function on R^d, of which the gradient is discontinuous, converges in probability to a neighborhood of the global minima of the potential function.     

Simulated annealing metaheuristics for the vehicle routing problem with time windows

This paper develops simulated annealing metaheuristics for the vehicle routing and scheduling problem with time window constraints. Two different neighborhood structures, the λ-interchange mechanism of Osman and thek-node interchange process of Christofides and Beasley, are implemented. The enhancement of the annealing process with a short-term memory function via a tabu list is examined as a basis for improving the metaheuristic approach. Computational results on test problems from the literature as well as large-scale real-world problem are reported. The metaheuristics achieve solutions that compare favorably with previously reported results.     

融合改进Tent混沌和模拟退火的灰狼算法

针对标准灰狼算法种群多样性差、后期收敛速度慢、易陷入局部最优的缺陷,提出一种改进灰狼算法.利用改进Tent混沌映射初始化种群,增加种群多样性;引入螺旋函数,提高算法收敛速度;融合模拟退火思想,避免陷入局部最优;设置搜索阈值,平衡全局搜索与局部搜索;利用改进Tent混沌映射产生新个体,替换性能较差个体并进行高斯扰动,增加...     

基于SMMC模型的数据多流形结构分析研究

采用混合多流形谱聚类模型(SMMC)对独立子空间、非独立子空间,非线性良分离及非线性交叉等流形聚类中的四种典型数据进行聚类,并与其他流形聚类方法进行比较,发现SMMC模型聚类效果良好且具有强鲁棒性和泛化能力.将SMMC模型运用于具有混合多流形结构的工件外部边缘轮廓进行聚类,结果显示SMMC模型能够很好的将其分为三类.针对SMMC模型复杂度高、选取参数困难及运行时间长的问题,提出了基于模拟退火遗传算法SMMC模型,结果发现改进后的模型能够大大缩短运行时间.     

Asymptotics of instability zones of the Hill operator with a two term potential

Let γn denote the length of the nth zone of instability of the Hill operator Ly=−y^″−[4tαcos2x+2α²cos4x]y, where α≠0, and either both α, t are real, or both are pure imaginary numbers. For even n we prove: if t, n are fixed, then for α→0

     

Sharp gradient estimates for quasilinear elliptic equations with p(x) growth on nonsmooth domains

In this paper, we study quasilinear elliptic equations with the nonlinearity modelled after the $p(x)$-Laplacian on nonsmooth domains and obtain sharp Calderón–Zygmund type estimates in the variable exponent setting. In a recent work of [12], the estimates obtained were strictly above the natural exponent and hence there was a gap between the natural energy estimates and estimates above $p(x)$, see (1.3) and (1.4). Here, we bridge this gap to obtain the end point case of the estimates obtained in [12], see (1.5). In order to do this, we have to obtain significantly improved a priori estimates below $p(x)$, which is the main contribution of this paper. We also improve upon the previous results by obtaining the estimates for a larger class of domains than what was considered in the literature.     

Fast algorithms for determining the linear complexities of sequences over GF(pm) with the period 3n

In this paper, for the the primes p such that 3 is a divisor of p − 1, we prove a result which reduces the computation of the linear complexity of a sequence over GF(p ^m) (any positive integer m) with the period 3n (n and p ^m − 1 are coprime) to the computation of the linear complexities of three sequences with the period n. Combined with some known algorithms such as generalized Games-Chan algorithm, Berlekamp-Massey algorithm and Xiao-Wei-Lam-Imamura algorithm, we can determine the linear complexity of any sequence over GF(p ^m) with the period 3n (n and p ^m − 1 are coprime) more efficiently.     

Minimizing the total completion time on a single machine with the learning effect and multiple availability constraints

This paper considers a single machine scheduling problem with the learning effect and multiple availability constraints that minimizes the total completion time. To solve this problem, a new binary integer programming model is presented, and a branch-and-bound algorithm is also developed for solving the given problem optimally. Since the problem is strongly NP-hard, to find the near-optimal solution for large-sized problems within a reasonable time, two meta-heuristics; namely, genetic algorithm and simulated annealing are developed. Finally, the computational results are provided to compare the result of the binary integer programming, branch-and-bound algorithm, genetic algorithm and simulated annealing. Then, the efficiency of the proposed algorithms is discussed.     

An iterative method for minimizing a convex nonsmooth function on a convex smooth surface

An iterative algorithm is proposed for the constrained minimization of a convex nonsmooth function on a set given as a convex smooth surface. The convergence of the algorithm in the sense of necessary conditions for a local minimum is proved.     

Surfaces with pg = 2, K2 = 3 and a pencil of curves of genus 2

We classify minimal smooth surfaces of general type with K ² = 3, p _g = 2 which admit a fibration of curves of genus 2.We prove that they form an irreducible set of dimension 22 in their moduli space.      

On the Critical Exponents of Certain Nonlinear Boundary-Value Problems with Biharmonic Operator in the Exterior of a Ball

We establish sufficient conditions for the absence of global solutions of the differential inequality Δ² u≥|u|^q in the exterior of a ball. We consider various boundary conditions and show that the critical exponents depend on these conditions. The proofs are based on the test function method developed by Mitidieri and Pokhozhaev.     

Minimal surfaces with prescribed topological type on a Schwarzian chain inMc3

Similar to the investigations of unstable polygonal minimal surfaces by Courant [1] we introduce here a variational principle for the free boundary problem with prescribed topological type which produces minimal surfaces in Riemannian manifolds with constant curvature. For special boundary configurations the surfaces have no branch points. The approach can be applied to numerical algorithms since it is constructive.     

Jensen's inequality for a convex vector-valued function on an infinite-dimensional space

Jensen's inequality f(EX) ≤ Ef(X) for the expectation of a convex function of a random variable is extended to a generalized class of convex functions f whose domain and range are subsets of (possibly) infinite-dimensional linear topological spaces. Convexity of f is defined with respect to closed cone partial orderings, or more general binary relations, on the range of f. Two different methods of proof are given, one based on geometric properties of convex sets and the other based on the Strong Law of Large Numbers. Various conditions under which Jensen's inequality becomes strict are studied. The relation between Jensen's inequality and Fatou's Lemma is examined.     

On the p-version approximation in the boundary element method for a variational inequality of the second kind modelling unilateral contact and given friction

In this paper we complement recent work of Maischak and Stephan on adaptive hp-versions of the BEM for unilateral Signorini problems, respectively on FEM-BEM coupling in its h-version for a nonlinear transmission problem modelling Coulomb friction contact. Here we focus on the boundary element method in its p-version to treat a scalar variational inequality of the second kind that models unilateral contact and Coulomb friction in elasticity together. This leads to a nonconforming discretization scheme. In contrast to the work cited above and to a related paper of Guediri on a boundary variational inequality of the second kind modelling friction we take the quadrature error of the friction functional into account of the error analysis. At first without any regularity assumptions, we prove convergence of the BEM Galerkin approximation in the energy norm. Then under mild regularity assumptions, we establish an a priori error estimate that is based on a novel Céa–Falk lemma for abstract variational inequalities of the second kind.     

Solutions to a singularly perturbed parabolic equation with internal and boundary layers depending on stretched variables of different orders

The solution to a singularly perturbed parabolic equation with internal and boundary layers whose stretched variables may depend on different powers of the perturbation parameter is considered. An asymptotic representation of the solution is constructed and substantiated, and its stability is proved.     

Spectral multipliers on a class of NA groups with rank two

We consider a family of real NA groups with rank two, and we prove that these groups have sub-Laplacians with differentiable Lp functional calculus for all p?1.