Unconstrained and constrained global optimization of polynomial functions in one variable

In Floudas and Visweswaran (1990), a new global optimization algorithm (GOP) was proposed for solving constrained nonconvex problems involving quadratic and polynomial functions in the objective function and/or constraints. In this paper, the application of this algorithm to the special case of polynomial functions of one variable is discussed. The special nature of polynomial functions enables considerable simplification of the GOP algorithm. The primal problem is shown to reduce to a simple function evaluation, while the relaxed dual problem is equivalent to the simultaneous solution of two linear equations in two variables. In addition, the one-to-one correspondence between the x and y variables in the problem enables the iterative improvement of the bounds used in the relaxed dual problem. The simplified approach is illustrated through a simple example that shows the significant improvement in the underestimating function obtained from the application of the modified algorithm. The application of the algorithm to several unconstrained and constrained polynomial function problems is demonstrated.     

On a generalization of the Kalman-Yakubovic lemma

In this paper we generalize the Kalman-Yakubovic lemma to infinite dimensions—or, more precisely, to semigroups of operators over a Hilbert space. The proof differs substantially from the finite-dimensional version and is based on the Paley-Wiener-Helson-Lowdenslager factorization theorem.     

Analysis of an retrial queue

We consider a single server retrial queueing system in which each customer (primary or retrial customer) has discrete service times taking on value D_j with probability , and . An arriving primary customer who finds the server busy tries later. Moreover, each retrial customer has its own orbit, and the retrial customers try to enter the service independently of each other. We call this retrial queue an M/{D_n}/1 retrial queue. A necessary and sufficient condition for this system stability is given. In the steady state, we derive the joint distribution of the state of the server and the number of customers in the retrial orbits. The explicit expressions of some performance measures are given. In addition, the steady-state distribution of the waiting time is discussed.     

A continuation and existence result for a boundary value problem on an unbounded domain arising for the electrical potential in a cylindrical double layer

Using a continuation theorem for contractions, the existence, uniqueness, and an approximation method for a class of nonlinear boundary value problems on an unbounded interval is obtained. The results apply in particular to the problem in the title.     

Regularized product expressions of higher Riemann zeta functions

As a generalization of recent work by Kurokawa, Matsuda, and Wakayama (2004) we introduce a higher Riemann zeta function for an abstract sequence. Then we explicitly determine its regularized product expression.

     

Noise-induced global asymptotic stability

We prove analytically that additive and parametric (multiplicative) Gaussian distributed white noise, interpreted in either the Itô or Stratonovich formalism, induces global asymptotic stability in two prototypical dynamical systems designated as supercritical (the Landau equation) and subcritical, respectively. In both systems without noise, variation of a parameter leads to a switching between a single, globally stable steady state and multiple, locally stable steady states. With additive noise this switching is mirrored in the behavior of the extrema of probability densities at the same value of the parameter. However, parametric noise causes a noise-amplitude-dependent shift (postponement) in the parameter value at which the switching occurs. It is shown analytically that the density converges to a Dirac delta function when the solution of the Fokker-Planck equation is no longer normalizable.     

Equations of attainable set dynamics,part 1: Integral funnel equations

In control theory, there is growing interest in the evolution of sets, especially attainable sets at timet. This is caused due to their applications to control under uncertainty, optimal control, and differential games. Recently, a new mathematical theory for attainable set evolution was developed. It is based on the concept of approximate localization, instead of differentiation. Here, we give a generalization of this theory.     

关于Hale问题

本文推广了林振声关于 Hale 问题的解答,利用微分系统的指数型三分性给出了弱概周期微分系统中心积分流形的存在性定理.     

Seven kinds of monotone maps

Known as well as new types of monotone and generalized monotone maps are considered. For gradient maps, these generalized monotonicity properties can be related to generalized convexity properties of the underlying function. In this way, pure first-order characterizations of various types of generalized convex functions are obtained.