Lipschitzian inverse functions,directional derivatives,and applications inC 1,1 optimization

The paper shows that Thibault's limit sets allow an iff-characterization of local Lipschitzian invertibility in finite dimension. We consider these sets as directional derivatives and extend the calculus in a way that can be used to clarify whether critical points are strongly stable inC ^1,1 optimization problems.Many fruitful discussions with colleagues D. Klatte and K. Tammer as well as with H. Th. Jongen and F. Nozicka have influenced the present investigations in a very constructive manner. For the original papers concerning the sets f(x; u), the author is indebted to Prof. L. Thibault.     

Estimating a survival function with incomplete cause-of-death data

We propose a random censorship model which permits uncertainty in the cause of death assessments for a subset of the subjects in a survival experiment. A nonparametric maximum likelihood approach and a “self-consistency” approach are considered. The solution sets corresponding to both approaches are found. They are infinite and identical. Only some of the solutions are consistent; i.e., the MLEs and self-consistent estimators are not consistent in general. Two estimates are thus proposed and their asymptotic properties are studied. It is shown that both estimates are strongly consistent and converge to Gaussian processes. The covariance structures of these Gaussian processes are derived.     

A numerically stable algorithm for two server queue models

In this paper, we consider a queueing system in which there are two exponential servers, each having his own queue, and arriving customers will join the shorter queue. Based on the results given in Flatto and McKean, we rewrite the formula for the probability that there are exactlyk customers in each queue, wherek = 0, 1,…. This enables us to present an algorithm for computing these probabilities and then to find the joint distribution of the queue lengths in the system. A program and numerical examples are given.     

Tangent cones and Dini derivatives

We prove a property of the Bouligand tangent cone to the epigraph (or to the graph) of a locally Lipschitz function. It is also shown how this result can be used in determining Dini sequences. Finally, some relationships between such a cone and Dini derivatives are provided.     

非光滑非凸多目标规划解的充分条件

Kuhn-Tucker型条件的充分性一直是最优化理论中引人注意的一个问题.本文对非光滑函数提出了几个非凸概念,然后,讨论了非光滑非凸多目标规划中Kuhn-Tucker型条件和Fritz John型条件的充分性,在很弱的条件下,建立了一系列充分条件.     

非光滑多目标分式规划的对偶条件

最优性问题在研究博弈理论、目标规划、最低风险问题等方面有重要应用,利用非光滑分析,定义了一类新的广义不变凸函数,研究了涉及此类函数的多目标半无限分式规划问题, 得到了参数对偶问题的弱对偶和严格逆对偶条件,在新的凸性下得到了一些重要结论.     

生长曲线模型中回归系数阵的极大似然估计的精确分布

对于生长曲线模型,基于理论发展和应用效果的考虑,本文引入了Gauss型误差．在此误差下,本文研究了模型中回归系数阵的极大似然估计的精确分布,求出了此分布的密度和特征函数．     

两种D III型有界对称域的逆ABEL变换

利用bc     

A Branch and Contract Algorithm for Problems with Concave Univariate, Bilinear and Linear Fractional Terms

A new deterministic branch and bound algorithm is presented in this paper for the global optimization of continuous problems that involve concave univariate, bilinear and linear fractional terms. The proposed algorithm, the branch and contract algorithm, relies on the use of a bounds-contraction subproblem that aims at reducing the size of the search region by eliminating portions of the domain in which the objective function takes only values above a known upper bound. The solution of contraction subproblems at selected branch and bound nodes is performed within a finite contraction operation that helps reducing the total number of nodes in the branch and bound solution tree. The use of the proposed algorithm is illustrated with several numerical examples.     

On The Correlation Of Binary M-sequences

We obtain the upper bound O(2^14n/15 n^−1/5) on the number of distinct values of all possible correlation functions between M-sequences of order n .