Continuous-time portfolio selection with liability: Mean–variance model and stochastic LQ approach

In this paper we formulate a continuous-time mean–variance portfolio selection model with multiple risky assets and one liability in an incomplete market. The risky assets’ prices are governed by geometric Brownian motions while the liability evolves according to a Brownian motion with drift. The correlations between the risky assets and the liability are considered. The objective is to maximize the expected terminal wealth while minimizing the variance of the terminal wealth. We derive explicitly the optimal dynamic strategy and the mean–variance efficient frontier in closed forms by using the general stochastic linear-quadratic (LQ) control technique. Several special cases are discussed and a numerical example is also given.     

Uncertainty calculations in the certification of reference materials

To serve as a measurement standard, a (certified) reference material must be stable. For this purpose, the material should undergo stability testing after it has been prepared. This paper looks at the statistical aspects of stability testing. Essentially, these studies can be described with analysis of variance statistics, including variant regression analysis. The latter is used in practice for both trend analysis and for the development of expressions for extrapolations. Extrapolation of stability data is briefly touched upon, as far as the combined standard uncertainty of the reference material is concerned. There are different options to validate the extrapolations made from initial stability studies, and some of them might influence the uncertainty of the reference material and/or the shelf-life. The latter is the more commonly observed consequence of what is called ’stability monitoring’. Received: 6 October 2000 Accepted: 4 December 2000     

A mixed integer programming model for multistage mean–variance post-tax optimization

In this paper, we introduce a mixed integer stochastic programming approach to mean–variance post-tax portfolio management. This approach takes into account of risk in a multistage setting and allows general withdrawals from original capital. The uncertainty on asset returns is specified as a scenario tree. The risk across scenarios is addressed using the probabilistic approach of classical stochastic programming. The tax rules are used with stochastic linear and mixed integer quadratic programming models to compute an overall tax and return-risk efficient multistage portfolio. The incorporation of the risk term in the model provides robustness and leads to diversification over wrappers and assets within each wrapper. General withdrawals and risk aversion have an impact on the distribution of assets among wrappers. Computational results are presented using a study with different scenario trees in order to show the performance of these models.     

Matching inductive search bias and problem structure in continuous Estimation-of-Distribution Algorithms

Research into the dynamics of Genetic Algorithms (GAs) has led to the field of Estimation-of-Distribution Algorithms (EDAs). For discrete search spaces, EDAs have been developed that have obtained very promising results on a wide variety of problems. In this paper we investigate the conditions under which the adaptation of this technique to continuous search spaces fails to perform optimization efficiently. We show that without careful interpretation and adaptation of lessons learned from discrete EDAs, continuous EDAs will fail to perform efficient optimization on even some of the simplest problems. We reconsider the most important lessons to be learned in the design of EDAs and subsequently show how we can use this knowledge to extend continuous EDAs that were obtained by straightforward adaptation from the discrete domain so as to obtain an improvement in performance. Experimental results are presented to illustrate this improvement and to additionally confirm experimentally that a proper adaptation of discrete EDAs to the continuous case indeed requires careful consideration.     

拟似然非线性模型的某些渐近推断:几何方法

Abstract. A modified Bates and Watts geometric framework is proposed for quasi-likelihoodnonlinear models in Euclidean inner product space. Based on the modified geometric framework,some asymptotic inference in terms of curvatures for quasi-likelihood nonlinear models is stud-ied. Several previous results for nonlinear regression models and exponential family nonlinearmodels etc. are extended to quasi-likelihood nonlinear models.     

A general model of parameterized OWA aggregation with given orness level

The paper proposes a general optimization model with separable strictly convex objective function to obtain the consistent OWA (ordered weighted averaging) operator family. The consistency means that the aggregation value of the operator monotonically changes with the given orness level. Some properties of the problem are discussed with its analytical solution. The model includes the two most commonly used maximum entropy OWA operator and minimum variance OWA operator determination methods as its special cases. The solution equivalence to the general minimax problem is proved. Then, with the conclusion that the RIM (regular increasing monotone quantifier) can be seen as the continuous case of OWA operator with infinite dimension, the paper further proposes a general RIM quantifier determination model, and analytically solves it with the optimal control technique. Some properties of the optimal solution and the solution equivalence to the minimax problem for RIM quantifier are also proved. Comparing with that of the OWA operator problem, the RIM quantifier solutions are usually more simple, intuitive, dimension free and can be connected to the linguistic terms in natural language. With the solutions of these general problems, we not only can use the OWA operator or RIM quantifier to obtain aggregation value that monotonically changes with the orness level for any aggregated set, but also can obtain the parameterized OWA or RIM quantifier families in some specific function forms, which can incorporate the background knowledge or the required characteristic of the aggregation problems.     

The Asymptotic Variance of the Continuous-Time Kernel Estimator with Applications to Bandwidth Selection

We derive simple expressions for the asymptotic variance of the kernel-density estimator of a stationary continuous-time process in one and d dimensions and relate convergence rates to sample path smoothness. Important applications include methods for selecting optimal smoothing parameters and construction of confidence bands for testing hypotheses about the density. In a simulation study the results are applied to bandwidth selection for discrete-time processes that can be modelled as continuous-time processes sampled at a high rate.     

Timing error estimation for baseband multicarrier modulation

In this paper, the topic of timing error estimation for baseband discrete multitone modulation is addressed in the context of high‐speed digital subscriber line applications. To the authors' best knowledge, this problem is sparsely and not in depth treated in the literature. In this study the modified Cramer–Rao lower bound is derived, two conventional estimators are considered and a new one is proposed. Behavior of these estimators is evaluated in terms of bias, variance and computational complexity in a wide variety of scenarios, concluding that the proposed estimator appears to be superior in all instances. Copyright © 2008 John Wiley & Sons, Ltd.     

无穷方差厚尾过程变点的小波估计

研究随机设计下噪声为厚尾随机变量时非参数函数中的变点估计问题.首先,通过设计变换将随机设计转化为等间距固定设计,进而利用小波方法估计变换后的变点的位置,再利用逆设计变换求得随机设计下变点位置的估计,并给出估计的收敛速度.模拟研究结果说明对于无穷方差厚尾过程中的变点估计问题小波方法是有效的.     

Some sufficient conditions for the E- and MV-optimality of block designs having blocks of unequal size

Summary In this paper we consider experimental situations in which ν treatments are to be tested inb blocks whereb _i blocks containk _i experimental units,i=1,...,p, k ₁<k ₂<...<k _p . The idea of a group divisible (GD) design is extended to that of a group divisible design with unequal block sizes (GDUB design) and then a number of results concerning the E- and MV-optimality of GD designs are generalized to the case of GDUB designs.