On many‐sorted algebraic closure operators

A theorem of Birkhoff‐Frink asserts that every algebraic closure operator on an ordinary set arises, from some algebraic structure on the set, as the corresponding generated subalgebra operator. However, for many‐sorted sets, i.e., indexed families of sets, such a theorem is not longer true without qualification. We characterize the corresponding many‐sorted closure operators as precisely the uniform algebraic operators. (© 2004 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

Equivalence of two linear programming relaxations for broadcast scheduling

A server needs to compute a broadcast schedule for n pages whose request times are known in advance. Outputting a page satisfies all outstanding requests for the page. The goal is to minimize the average waiting time of a client. In this paper, we show the equivalence of two apparently different relaxations that have been considered for this problem.     

Robust linear optimization under general norms

We explicitly characterize the robust counterpart of a linear programming problem with uncertainty set described by an arbitrary norm. Our approach encompasses several approaches from the literature and provides guarantees for constraint violation under probabilistic models that allow arbitrary dependencies in the distribution of the uncertain coefficients.     

Error estimates for Hermite interpolation on spheres

In this paper, we prove convergence rates for spherical spline Hermite interpolation on the sphere S^d−1 via an error estimate given in a technical report by Luo and Levesley. The functionals in the Hermite interpolation are either point evaluations of pseudodifferential operators or rotational differential operators, the desirable feature of these operators being that they map polynomials to polynomials. Convergence rates for certain derivatives are given in terms of maximum point separation.     

Boundedness of Multilinear Operators on Herz Type Spaces： Extreme Cases

In this paper, two classes of closely related multilinear singular and fractional integrals,which include the commutators as special cases, are studied and their boundedness on Herz type spaces is discussed. In fact, it is proved that these operators are actually not bounded in certain extreme cases.     

Bernstein-Fan插值算子的逼近阶估计及其算法程序

本文研究了具有三角形波基函数的Bernstein-Fan值算子的收敛定理和逼近阶估计，并给出了它的算法程序。     

A Fixed Point Theorem for Multi—valued Composite Increasing Operators

Ａ　Ｆｉｘｅｄ　Ｐｏｉｎｔ　Ｔｈｅｏｒｅｍ　ｆｏｒ　Ｍｕｌｔｉ－ｖａｌｕｅｄ　Ｃｏｍｐｏｓｉｔｅ　Ｉｎｃｒｅａｓｉｎｇ　ＯｐｅｒａｔｏｒｓＬｉＦｅｎｇｙｏｕ（李凤友）（ＤｅｐａｒｔｍｅｎｔｏｆＭａｔｈｅｍａｔｉｃｓ，Ｔｉａｎｊｉｎ＇ＮｏｒｍａｌＵｎｉ...     

The projective method for solving linear matrix inequalities

Numerous problems in control and systems theory can be formulated in terms of linear matrix inequalities (LMI). Since solving an LMI amounts to a convex optimization problem, such formulations are known to be numerically tractable. However, the interest in LMI-based design techniques has really surged with the introduction of efficient interior-point methods for solving LMIs with a polynomial-time complexity. This paper describes one particular method called the Projective Method. Simple geometrical arguments are used to clarify the strategy and convergence mechanism of the Projective algorithm. A complexity analysis is provided, and applications to two generic LMI problems (feasibility and linear objective minimization) are discussed.     

Banach空间中一类非线性算子Ishikawa迭代序列收敛定理

在一般的Banach空间中,研究了Ishikawa迭代序列收敛问题,去掉了通常文献中关于空间X的一致光滑或S-一致光滑的严格要求,此外,还去掉或减弱了其它某些条件。因而本质地改进了近期文献的一系列相应定理。     

POSITIVE SOLUTIONS FOR NONHOMOGENEOUS ELLIPTIC EQUATIONSWITH CRITICAL GROWTH ON R~(2)

1IntroductionIntillspaper,weare(follccrlledwitlltileexistellccofPositly(tsollltiollsoftilefollowillgnonhonlogelleousellipticProblclll:whereg(x)EL'(R'),g(:v)Z0alldg(x)t0,f(x,t)=h(x,t).hi=withb>0,h(x,t)EC(R=xR,R)alldtilefollowing(CI)-(C3)11old:(CI)sliphillM0.linljfl- x,h(T,t)(t--if-=011llif'orllllyforxeR2.hill}t:l-:,t)(axle(~ltJ')= lx,11lliforllllyl'Ora:6RZ.ltl~la(C3)ThereexistM>0,aE(0,1]sucllthatFOllowing[1,5],wesaythatf(x,t)=h(x,f…