解无约束最优化的基于锥模型的过滤集- 信赖域方法

锥模型优化方法是一类非二次模型优化方法, 它在每次迭代中比标准的二次模型方法含有更丰富的插值信息. Di 和Sun (1996) 提出了解无约束优化问题的锥模型信赖域方法. 本文根据Fletcher 和Leyffer (2002) 的过滤集技术的思想, 在Di 和Sun (1996) 工作的基础上, 提出了解无约束优化问题的基于锥模型的过滤集信赖域算法. 在适当的条件下, 我们证明了新算法的收敛性. 有限的数值试验结果表明新算法是有效的.     

Lacunary Strong (<Emphasis Type="Italic">A</Emphasis><Subscript><Emphasis Type="Italic">σ</Emphasis></Subscript><Emphasis Type="Italic">, p</Emphasis>)-Convergence

The definition of lacunary strongly convergence is extended to the definition of lacunary strong (A _σ , p)-convergence with respect to invariant mean when A is an infinite matrix and p = (p _i ) is a strictly positive sequence. We study some properties and inclusion relations.     

Consecutive customer losses in regular and oscillating <Emphasis Type="Italic">M</Emphasis><Superscript><Emphasis Type="Italic">X</Emphasis></Superscript>/<Emphasis Type="Italic">G</Emphasis>/1/<Emphasis Type="Italic">n</Emphasis> systems

We derive fast recursions to compute the probability that k or more consecutive customer losses take place during a busy period of a queue, the so called k-CCL probability, for regular and oscillating M ^X /G/1/n systems.     

An Algorithm for Corona Solutions on <Emphasis Type="Italic">H</Emphasis><Superscript>∞</Superscript> (<Emphasis Type="Italic">D</Emphasis>)

We give an algorithm to find corona solutions in H ^∞ (D) for polynomial input data. Partially supported by NSF Grant DMS-0400307.     

On the value distribution of <Emphasis Type="Italic">ƒ</Emphasis> + <Emphasis Type="Italic">a</Emphasis>(<Emphasis Type="Italic">ƒ</Emphasis>′)<Superscript><Emphasis Type="Italic">n</Emphasis></Superscript>

Let ƒ be a transcendental meromorphic function, a a nonzero finite complex number, and n ⩾ 2 a positive integer. Then ƒ + a(ƒ′) ⁿ assumes every complex value infinitely often. This answers a question of Ye for n = 2. A related normality criterion is also given. This work was supported by the National Natural Science Foundation of China (Grant No. 10771076), the Natural Science Foundation of Guangdong Province, China (Grant No. 07006700) and by the German-Israeli Foundation for Scientific Research and Development (Grant No. G-809-234.6/2003)     

Littlewood–Paley theorem on spaces <Emphasis Type="Italic">L</Emphasis><Superscript><Emphasis Type="Italic">p</Emphasis>(<Emphasis Type="Italic">t</Emphasis>)</Superscript>(ℝ<Superscript><Emphasis Type="Italic">n</Emphasis></Superscript>)

We point out that if the Hardy–Littlewood maximal operator is bounded on the space L ^p(t)(ℝ), 1 < a ≤ p(t) ≤ b < ∞, t ∈ ℝ, then the well-known characterization of the spaces L ^p (ℝ), 1 < p < ∞, by the Littlewood–Paley theory extends to the space L ^p(t)(ℝ). We show that, for n > 1 , the Littlewood–Paley operator is bounded on L ^p(t) (ℝ ⁿ ), 1 < a ≤ p(t) ≤ b < ∞, t ∈ ℝ ⁿ , if and only if p(t) = const. Published in Ukrains’kyi Matematychnyi Zhurnal, Vol. 60, No. 12, pp. 1709–1715, December, 2008.     

Approximations for the <Emphasis Type="Italic">M</Emphasis>/<Emphasis Type="Italic">GI</Emphasis>/<Emphasis Type="Italic">N</Emphasis>+<Emphasis Type="Italic">GI</Emphasis> type call center

In this paper, we propose approximations to compute the steady-state performance measures of the M/GI/N+GI queue receiving Poisson arrivals with N identical servers, and general service and abandonment-time distributions. The approximations are based on scaling a single server M/GI/1+GI queue. For problems involving deterministic and exponential abandon times distributions, we suggest a practical way to compute the waiting time distributions and their moments using the Laplace transform of the workload density function. Our first contribution is numerically computing the workload density function in the M/GI/1+GI queue when the abandon times follow general distributions different from the deterministic and exponential distributions. Then we compute the waiting time distributions and their moments. Next, we scale-up the M/GI/1+GI queue giving rise to our approximations to capture the behavior of the multi-server system. We conduct extensive numerical experiments to test the speed and performance of the approximations, which prove the accuracy of their predictions.      

3-Selmer groups for curves <Emphasis Type="Italic">y</Emphasis><Superscript>2</Superscript> = <Emphasis Type="Italic">x</Emphasis><Superscript>3</Superscript> + <Emphasis Type="Italic">a</Emphasis>

We explicitly perform some steps of a 3-descent algorithm for the curves y ² = x ³ + a, a a nonzero integer. In general this will enable us to bound the order of the 3-Selmer group of such curves.     

Embedding of non-commutative <Emphasis Type="Italic">L</Emphasis><Superscript><Emphasis Type="Italic">p</Emphasis></Superscript>-spaces: <Emphasis Type="Italic">p</Emphasis> < 1

If (N,t) ({\cal N},\tau) is a finite von Neumann algebra and if (M,n) ({\cal M},\nu) is an infinite von Neumann algebra, then L_p(M,n) L_{p}({\cal M},\nu) does not Banach embed in L_p(N,t) L_{p}({\cal N},\tau) for all p ? (0,1) p\in (0,1) . We also characterize subspaces of $ L_{p}({\cal N},\tau),\ 0< p <1 $ L_{p}({\cal N},\tau),\ 0< p <1 containing a copy of l_p.     

<Emphasis Type="Italic">L</Emphasis><Superscript><Emphasis Type="Italic">p</Emphasis></Superscript>(<Emphasis Type="Italic">AP</Emphasis>) spaces (1 ≤ <Emphasis Type="Italic">p</Emphasis> ≤ ∞) and their adjoint ones

We study Besicovitch-type spaces of generalized almost periodic functions. The main result is a theorem on representation of linear continuous functionals that is similar to the classical result of F. Riesz.     

New examples of Cantor sets in <Emphasis Type="Italic">S</Emphasis><Superscript>1</Superscript> that are not <Emphasis Type="Italic">C</Emphasis><Superscript>1</Superscript>-minimal

Although every Cantor subset of the circle (S¹) is the minimal set of some homeomorphism of S¹, not every such set is minimal for a C¹ diffeomorphism of S¹. In this work, we construct new examples of Cantor sets in S¹ that are not minimal for any C¹-diffeomorphim of S¹.     

Rate of convergence to ergodic distribution for queue length in systems of the type <Emphasis Type="Italic">M</Emphasis><Superscript>θ</Superscript>/<Emphasis Type="Italic">G</Emphasis>/1/<Emphasis Type="Italic">N</Emphasis>

For finite-capacity queuing systems of the type M ^θ/G/1, convenient formulas for the ergodic distribution of the queue length are found, an estimate for the rate of convergence of the distribution of the queue length in the transient mode to the ergodic distribution is obtained, and computational algorithms for finding the rate of convergence are presented. __________ Translated from Ukrains’kyi Matematychnyi Zhurnal, Vol. 59, No. 9, pp. 1169–1178, September, 2007.     

Composite Integers n for Which φ（n）｜n- 1

In this note, we show that the number of composite integers n ≤ x such that φ（n）｜n - 1 is at most O（x^1/2（loglog x）^1/2）, thus improving earlier results by Pomerance and by Shan.     

Semiclassical <Emphasis Type="Italic">L</Emphasis><Superscript><Emphasis Type="Italic">p</Emphasis></Superscript> Estimates

The purpose of this paper is to use semiclassical analysis to unify and generalize L ^p estimates on high energy eigenfunctions and spectral clusters. In our approach these estimates do not depend on ellipticity and order, and apply to operators which are selfadjoint only at the principal level. They are estimates on weakly approximate solutions to semiclassical pseudodifferential equations. Submitted: May 11, 2006. Accepted: September 19, 2006.     

Harnack estimate for the <Emphasis Type="Italic">H</Emphasis><Superscript><Emphasis Type="Italic">k</Emphasis></Superscript>-flow

We obtain the Harnack estimate of the solution to Hk-flow in Euclidean space Rn 1,for k ＞ 0.By using this estimate,we get some corollaries about the translation soliton.     

Group invariance and <Emphasis Type="Italic">L</Emphasis><Superscript><Emphasis Type="Italic">p</Emphasis></Superscript>-bounded operators

The Hilbert and Riesz transforms can be characterized up to scalar as the translation invariant operators that satisfy additionally certain relative invariance of conformal transformation groups. In this article, we initiate a systematic study of translation invariant operators from group theoretic viewpoints, and formalize a geometric condition that characterizes specific multiplier operators uniquely up to scalar by means of relative invariance of affine subgroups. After providing some interesting examples of multiplier operators having “large symmetry”, we classify which of these examples can be extended to continuous operators on L ^p (R ⁿ ) (1 < p < ∞). T. Kobayashi was partially supported by Grant-in-Aid for Scientific Research 18340037, Japan Society for the Promotion of Science. A. Nilsson was partially supported by Japan Society for the Promotion of Science.     

Extensions of Well-Boundedness and <Emphasis Type="Italic">C</Emphasis><Superscript><Emphasis Type="Italic">m</Emphasis></Superscript>-Scalarity

We consider some extensions of well-boundedness and C^m-scalarity by using fractional calculus, and prove some theorems accordingly. These results are applied to the usual Laplacian on Rⁿ and sub-Laplacians on nilpotent Lie groups. The research of first and second authors has been partly supported by the Project MTM2004-03036 of the M.C.YT.-DGI/F.E.D.E.R., Spain, and the Project E-12/25, D. G. Aragón, Spain. Part of the research of second author was developed in the Christian-Albrechts Universit?t in Kiel, while he was enjoying a HARP-postdoctoral position in the European Harmonic Analysis Network, HARP, IHP 2002-06.     

Analysis of GI<Superscript><Emphasis Type="Italic">X</Emphasis></Superscript>/<Emphasis Type="Italic">M</Emphasis>(<Emphasis Type="Italic">n</Emphasis>)//<Emphasis Type="Italic">N</Emphasis> systems with stochastic customer acceptance policy

We investigate GI ^X /M(n)//N systems with stochastic customer acceptance policy, function of the customer batch size and the number of customers in the system at its arrival. We address the time-dependent and long-run analysis of the number of customers in the system at prearrivals and postarrivals of batches and seen by customers at their arrival to the system, as well as customer blocking probabilities. These results are then used to derive the continuous-time long-run distribution of the number of customers in the system. Our analysis combines Markov chain embedding with uniformization and uses stochastic ordering as a way to bound the errors of the computed performance measures.