Devaney混沌的随机性质

讨论了Devaney混沌的随机性质,证明了如果度量空间上的连续变换f是弱混合的,那么f是拓扑传递的,并且若f的周期点稠密,则f还是初值敏感的.     

Integral representation of the W-weighted Drazin inverse for Hilbert space operators

This paper studies the integral representation of the W-weighted Drazin inverse for bounded linear operators between Hilbert spaces. By using operator matrix blocks, some integral representations of the W-weighted Drazin inverse for Hilbert space operators are established.     

Integral points, divisibility between values of polynomials and entire curves on surfaces

We prove some new degeneracy results for integral points and entire curves on surfaces; in particular, we provide the first examples, to our knowledge, of a simply connected smooth variety whose sets of integral points are never Zariski-dense. Some of our results are connected with divisibility problems, i.e. the problem of describing the integral points in the plane where the values of some given polynomials in two variables divide the values of other given polynomials.     

Sensitivity analysis in linear semi-infinite programming: Perturbing cost and right-hand-side coefficients

This paper analyzes the effect on the optimal value of a given linear semi-infinite programming problem of the kind of perturbations which more frequently arise in practical applications: those which affect the objective function and the right-hand-side coefficients of the constraints. In particular, we give formulae which express the exact value of a perturbed problem as a linear function of the perturbation.     

Projections on Convex Sets in the Relaxed Limit

The paper establishes the continuity of the best approximation, or the projection, of a function in L _p for p[1,), on a closed convex set in the space, when the set varies and converges to a limit set in the Young-measure relaxation of the space. To this end a strong-type convergence and a convexity structure are identified on the space of Young measures. The appropriate convergence of sets with respect to which the continuity holds is the Mosco convergence of sets associated with the strong-type convergence of functions.     

Degeneracy in NLP and the development of results motivated by its presence

We study notions of nondegeneracy and several levels of increasing degeneracy from the perspective of the local behavior of a local solution of a nonlinear program when problem parameters are slightly perturbed. Ideal nondegeneracy at a local minimizer is taken to mean satisfaction of second order sufficient conditions, linear independence and strict complimentary slackness. Following a brief exploration of the relationship of these conditions with the classical definition of nondegeneracy in linear programming, we recall a number of optimality and regularity conditions used to attempt to resolve degeneracy and survey results of Fiacco, McCormick, Robinson, Kojima, Gauvin and Janin, Shapiro, Kyparisis and Liu. This overview may be viewed as a structured survey of sensitivity and stability results: the focus is on progressive levels of degeneracy. We note connections of nondegeneracy with the convergence of algorithms and observe the striking parallel between the effects of nondegeneracy and degeneracy on optimality conditions, stability analysis and algorithmic convergence behavior. Although our orientation here is primarily interpretive and noncritical, we conclude that more effort is needed to unify optimality, stability and convergence theory and more results are needed in all three areas for radically degenerate problems.Research supported by National Science Foundation Grant ECS 90-00560 and Grant N00014-89-J-1537 Office of Naval Research     

Simple Explanation of the No-Free-Lunch Theorem and Its Implications

The no-free-lunch theorem of optimization (NFLT) is an impossibility theorem telling us that a general-purpose, universal optimization strategy is impossible. The only way one strategy can outperform another is if it is specialized to the structure of the specific problem under consideration. Since optimization is a central human activity, an appreciation of the NFLT and its consequences is essential. In this paper, we present a framework for conceptualizing optimization that leads to a simple but rigorous explanation of the NFLT and its implications.     

一类非线性Volterra积分微分方程的周期解

本文借助laplace变换及不动点理论,研究了系统(?)=Ax+integral from n=0 to t(c(t-s)x(s)ds)+F(t,x)的周期解的存在性。唯一性问题,给出了一组充分条件.     

Smoothed integral equations

For a linear integral equation there is a resolvent equation and a variation of parameters formula . It is assumed that B is a perturbed convex function and that a(t) may be badly behaved in several ways. When the first two equations are treated separately by means of a Liapunov functional, restrictive conditions are required separately on a(t) and B(t,s). Here, we treat them as a single equation where S is an integral combination of a(t) and B(t,s). There are two distinct advantages. First, possibly bad behavior of a(t) is smoothed. Next, properties of S needed in the Liapunov functional can be obtained from an array of properties of a(t) and B(t,s) yielding considerable flexibility not seen in standard treatment. The results are used to treat nonlinear perturbation problems. Moreover, the function is shown to converge pointwise and in L²[0,∞) to x(t).     

一般可测函数的(G)模糊积分

引入了一般可测函数的(G)模糊积分的概念,研究了这类积分的基本性质,并借助模糊测度的渐近结构特征讨论了这类(G)模糊积分的性质和绝对可积性.