由吴方法计算零维系统的有理单元表示

本文提出一个计算零维系统的有理单元表示的新算法.无需进行Grbner基运算,我们的算法仅运用了著名的吴方法.基于吴方法,我们的算法在Maple平台上被编制成一个通用程序RUR-Wu,可快速地计算出零维系统的有理单元表示.作为一个应用,本文提出了一个有效方法,用来计算某些多项式的整体最小值.此外,本文给出了几个实例,用来表明算法的效率.     

序有界模糊n-方体数集的上确界与下确界

本文中,我们讨论了在定义模糊n-方体数值映射的某种类型的积分时要用到的序有界模糊n-方体数集的上确界与下确界的问题。我们证明了序有界模糊n-方体数集的上、下确界的存在性,并给出了它们的表示。     

量子效应的下确界问题

Hilbert空间H上的一个量子效应A是满足0≤A≤I的正算子, 简称为效应A, 用E(H)表示所有效应构成的集合. Hilbert空间上两个效应的下确界问题是确定在何种条件下效应A和B∈E(H)的下确界A∧B存在.本文用算子谱理论的方法, 给出了两个效应A,B∈E(H)存在下确界A∧B的充分和必要的条件, 从而完全解决了该问题.     

本质下确界的最优性条件及其相对熵算法实现

为了研究带约束的本质下确界优化问题,介绍了m阶偏差积分并研究了它的性质,给出了其最优性条件和概念算法.基于极小化相对熵的技术,提出了一种实现算法,并有效地解决该优化问题.数值算例验证了算法的有效性.     

完全图全符号控制数的较小上界和下确界

设图G=G(V,E),令函数f∶V∪E→{-1,1},f的权w(f)=∑x∈V∪Ef[x],对V∪E中任一元素,定义f[x]=∑y∈NT[x]f(y),这里NT[x]表示V∪E中x及其关联边、邻点的集合.图G的全符号控制函数为f∶V∪E→{-1,1},满足对所有的x∈V∪E有f[x]1,图G的全符号控制数γT(G)就是图G上全符号控制数的最小权,称其f为图G的γT-函数.本文得到了完全图全符号控制数的一个较小上界和下确界.     

准幂零流形上映射同伦类的拓扑熵的下确界

设f:M→M是准幂零流形M上的连续自映射,N∞(f)是f的渐近Nielsen数.本文应用Nielsen不动点理论,给出log N∞(f)是f的同伦类中所有映射的拓扑熵的下确界的一个充要条件,该结果是关于幂零流形上类似结果的一个本质推广.     

(R)型准可解流形上映射同伦类的拓扑熵的下确界

设$f$是(R)型准可解流形$M$上的连续自映射, $N^\infty(f)$是$f$的渐近Nielsen数,本文将利用Nielsen不动点理论,给出$\log\,N^\infty(f)$是$f$的映射同伦类的拓扑熵的下确界的充分条件,这些条件将推广准幂零流形上的类似结果.     

基于混沌和填充函数的全局优化算法

本文把混沌优化算法和无参数填充函数有机结合起来,在提出一类无参数填充函数和证明其填充性质的基础上,构造出一种混合优化算法,该算法提高了全局最优解的精度和算法效率.按照理论分析设计了一个基于混沌的无参填充函数全局优化算法,理论分析和数值实验结果证明了算法的有效性和优越性.     

Wolfe线搜索下一类记忆梯度算法的全局收敛性（英文）

在本文中,首先我们提出一个记忆梯度算法,并讨论其在Wolfe线搜索下的下降性和全局收敛性.进一步地,我们将此算法推广到更一般的情形.最后,我们对这类记忆梯度方法的数值表现进行测试,并与PRP, FR, HS, LS, DY和CD共轭梯度法进行比较,数值结果表明这类算法是有效的.     

结合有效集和多维滤子技术的拟Newton信赖域算法(英文)

针对界约束优化问题,提出一个修正的多维滤子信赖域算法.将滤子技术引入到拟Newton信赖域方法,在每步迭代,Cauchy点用于预测有效集,此时试探步借助于求解一个较小规模的信赖域子问题获得.在一定条件下,本文所提出的修正算法对于凸约束优化问题全局收敛.数值试验验证了新算法的实际运行结果.     

Algorithms for computing the global infimum and minimum of a polynomial function

By catching the so-called strictly critical points,this paper presents an effective algorithm for computing the global infimum of a polynomial function.For a multivariate real polynomial f ,the algorithm in this paper is able to decide whether or not the global infimum of f is finite.In the case of f having a finite infimum,the global infimum of f can be accurately coded in the Interval Representation.Another usage of our algorithm to decide whether or not the infimum of f is attained when the global infimum of f is finite.In the design of our algorithm,Wu’s well-known method plays an important role.     

线性约束三次规划问题的全局最优性必要条件和最优化算法

讨论了带线性不等式约束三次规划问题的最优性条件和最优化算法. 首先, 讨论了带有线性不等式约束三次规划问题的 全局最优性必要条件. 然后, 利用全局最优性必要条件, 设计了解线性约束三次规划问题的一个新的局部最优化算法(强局部最优化算法). 再利用辅助函数和所给出的新的局部最优化算法, 设计了带有线性不等式约束三 规划问题的全局最优化算法. 最后, 数值算例说明给出的最优化算法是可行的、有效的.     

Determination of the limits for multivariate rational functions

The purpose of this paper is to solve the problem of determining the limits of multivariate rational functions.It is essential to decide whether or not limxˉ→0f g=0 for two non-zero polynomials f,g∈R[x1,...,xn]with f(0,...,0)=g(0,...,0)=0.For two such polynomials f and g,we establish two necessary and sufcient conditions for the rational functionf g to have its limit 0 at the origin.Based on these theoretic results,we present an algorithm for deciding whether or not lim(x1,...,xn)→(0,...,0)f g=0,where f,g∈R[x1,...,xn]are two non-zero polynomials.The design of our algorithm involves two existing algorithms:one for computing the rational univariate representations of a complete chain of polynomials,another for catching strictly critical points in a real algebraic variety.The two algorithms are based on the well-known Wu’s method.With the aid of the computer algebraic system Maple,our algorithm has been made into a general program.In the final section of this paper,several examples are given to illustrate the efectiveness of our algorithm.     

Cubic formulas for computing the zeros of certain quaternionic polynomial

In this paper, we derive the explicit formulas for computing the zeros of certain cubic quaternionic polynomial. From these, we obtain a necessary and sufficient condition to quaternionic cubic polynomial have a spherical zero, and some examples are also provided. Moreover, we will discuss some applications of the cubic quaternionic formulas. Copyright © 2017 John Wiley & Sons, Ltd.     

The minimal criterion for the equivalence between local and global optimal solutions in nondifferentiable optimization problem

In the paper, a necessary and sufficient criterion it provided such that any local optimal solution is also global in a not necessarily differentiable constrained optimization problem. This criterion is compared to others earlier appeared in the literature, which are sufficient but not necessary for a local optimal solution to be global. The importance of the established criterion is illustrated by suitable examples of nonconvex optimization problems presented in the paper.     

A filled function method for finding a global minimizer of a function of several variables

The concept of a filled function is introduced. We construct a particular filled function and analyze its properties. An algorithm for global minimization is generated based on the concept and properties of the filled function. Some typical examples with 1 to 10 variables are tested and computational results show that in most cases this algorithm works better than the tunneling algorithm. The advantages and disadvantages are analyzed and further research directions are discussed.     

一类特殊多项式整数规划问题的最优化算法

本文考虑了一类特殊的多项式整数规划问题。此类问题有很广泛的实际应用,并且是NP难问题。对于这类问题,最优性必要条件和最优性充分条件已经给出。我们在本文中将要利用这些最优性条件设计最优化算法。首 先,利用最优性必要条件,我们给出了一种新的局部优化算法。进而我们结合最优性充分条件、新的局部优化算法和辅助函数,设计了新的全局最优化算法。本文给出的算例展示出我们的算法是有效的和可靠的。     

LP relaxations for a class of linear semi-infinite programming problems

In this paper, we consider a subclass of linear semi-infinite programming problems whose constraint functions are polynomials in parameters and index sets are polyhedra. Based on Handelman’s representation of positive polynomials on a polyhedron, we propose two hierarchies of LP relaxations of the considered problem which respectively provide two sequences of upper and lower bounds of the optimum. These bounds converge to the optimum under some mild assumptions. Sparsity in the LP relaxations is explored for saving computational time and avoiding numerical ill behaviors.     

Failure of global convergence for a class of interior point methods for nonlinear programming

Using a simple analytical example, we demonstrate that a class of interior point methods for general nonlinear programming, including some current methods, is not globally convergent. It is shown that those algorithms produce limit points that are neither feasible nor stationary points of some measure of the constraint violation, when applied to a well-posed problem. Received: December 1999 / Accepted: May 2000?Published online August 18, 2000