Randomized heuristic algorithms for orthogonal projection of a point onto a set

Abstract

The problem of orthogonal projection of a point onto a set is an essential problem of computational geometry. This problem has many practical applications in different areas such as robotics, computer graphics and so on. In the present paper three algorithms for solving this problem are proposed. This algorithms are based on the idea of heuristic random search. Numerical experiments illustrating the work of the proposed methods are presented.     

Study of a Markov model for a high-quality dependent process

For high-quality processes, non-conforming items are seldom observed and the traditional p (or np) charts are not suitable for monitoring the state of the process. A type of chart based on the count of cumulative conforming items has recently been introduced and it is especially useful for automatically collected one-at-a-time data. However, in such a case, it is common that the process characteristics become dependent as items produced one after another are inspected. In this paper, we study the problem of process monitoring when the process is of high quality and measurement values possess a certain serial dependence. The problem of assuming independence is examined and a Markov model for this type of process is studied, upon which suitable control procedures can be developed.     

Maximum likelihood estimation in hazard rate models with a change-point

The problem of estimation of parameters in hazard rate models with a change-point is considered. An interesting feature of this problem is that the likelihood function is unbounded. A maximum likelihood estimator of the change-point subject to a natural constraint is proposed, which is shown to be consistent.The limiting distributions are also derived.     

Some Nonparametric Asymptotic Results for a Class of Stochastic Processes

This article provides a solution of a generalized eigenvalue problem for integrated processes of order 2 in a nonparametric framework. Our analysis focuses on a pair of random matrices related to such integrated process. The matrices are constructed considering some weight functions. Under asymptotic conditions on such weights, convergence results in distribution are obtained and the generalized eigenvalue problem is solved. Differential equations and stochastic calculus theory are used.     

Estimating the distribution function of a transformed random vector

Frequently a random vector Y with known distribution function is readily observed. However, the random variable of interest is a transformation of Y say h(Y), and sample values of h are expensive to evaluate. The objective is to estimate the distribution function of using only a small sample on Y. Four estimators are proposed for use when Y is discrete. A Monte Carlo study of the estimators is presented This estimation problem frequently arises when Y is a parameter in a mathematical programming problem and h(Y) is the optimal objective function value. Two examples of this type are presented.     

Analysis of a marker for cancer of the thyroid with a limit of detection

Limit of detection (LoD) is a common problem in the analysis of data generated by instruments that cannot detect very small concentrations or other quantities, resulting in left-censored measurements. Methods intended for data that are not subject to this problem are often difficult to modify for censoring. We adapt the simulation-extrapolation method, devised originally for fitting models with measurement error, to dealing with LoD in conjunction with a mixture analysis. The application relates the levels of thyroglobulin in individuals with cancer of the thyroid before and after treatment with radioactive iodine I–131. We conclude that the fitted mixture components correspond to levels of effectiveness of the treatment.     

Testing for a change in covariance operator

The paper considers a problem of equality of two covariance operators. Using functional principal component analysis, a method for testing equality of K largest eigenvalues and the corresponding eigenfunctions, together with its generalization to a corresponding change point problem is suggested. Asymptotic distributions of the test statistics are presented.     

Coverage plots for assessing the variability of estimated contours of a density

Methods for assessing the variability of an estimated contour of a density are discussed. A new method called the coverage plot is proposed. Techniques including sectioning and bootstrap techniques are compared for a particular problem which arises in Monte Carlo simulation approaches to estimating the spatial distribution of risk in the operation of weapons firing ranges. It is found that, for computational reasons, the sectioning procedure outperforms the bootstrap for this problem. The roles of bias and sample size are also seen in the examples shown.     

On a generalization of the test of endogeneity in a two stage least squares estimation

In situations that the predictors are correlated with the error term, we propose a bridge estimator in the two-stage least squares estimation. We apply this estimator to overcome the multicollinearity and sparsity of the explanatory variables, when the endogeneity problem is present.The proposed estimator was applied to modify the Durbin-Wu-Hausman (DWH) test of endogeneity in the presence of multicollinearity. To compare our modified test with the existing DWH for detection of an endogenous problem in multi-collinear data, some numerical assessments are carried out. The numerical results showed that the proposed estimators and the suggested test perform better for the multi-collinear data. Finally, a genetical data set is applied for illustration the our results by estimating the coefficients parameters in the presence of endogeneity and multicollinearity.     

On the Use of Bayes Factor in Frequentist Testing of a Precise Hypothesis

This article deals with Bayes factors as useful Bayesian tools in frequentist testing of a precise hypothesis. A result and several examples are included to justify the definition of Bayes factor for point null hypotheses, without merging the initial distribution with a degenerate distribution on the null hypothesis. Of special interest is the problem of testing a proportion (joint with a natural criterion to compare different tests), the possible presence of nuisance parameters, or the influence of Bayesian sufficiency on this problem. The problem of testing a precise hypothesis under a Bayesian perspective is also considered and two alternative methods to deal with are given.     

Border estimation of a two-dimensional uniform distribution if data are measured with additive error

The paper considers estimation of the boundary of an elliptical domain when the data without a measurement error are distributed uniformly on this domain but are superimposed by random errors. The problem is solved in two phases. In the first phase the domain is subdivided into thin slices and the endpoints of these slices are estimated within the framework of a corresponding one-dimensional problem. In the second phase the estimated endpoints are used to estimate the boundary using the total least-squares curve fitting procedure.     

Nonparametric estimation of the mode of a distribution of random curves

Motivated by the need to develop meaningful empirical approximations to a 'typical' data value, we introduce methods for density and mode estimation when data are in the form of random curves. Our approach is based on finite dimensional approximations via generalized Fourier expansions on an empirically chosen basis. The mode estimation problem is reduced to a problem of kernel-type multivariate estimation from vector data and is solved using a new recursive algorithm for finding the empirical mode. The algorithm may be used as an aid to the identification of clusters in a set of data curves. Bootstrap methods are employed to select the bandwidth.     

Solutions for a class of invex programming problems

A nonconvex constrained optimization problem is considered in which the constraints are of the form of generalized polynomials. An invexity kernel is established for this class of problem, and a consequent theorem gives sufficient conditions for the solutions of such problems.     

Consistency of the structured total least squares estimator in a multivariate errors-in-variables model

The structured total least squares estimator, defined via a constrained optimization problem, is a generalization of the total least squares estimator when the data matrix and the applied correction satisfy given structural constraints. In the paper, an affine structure with additional assumptions is considered. In particular, Toeplitz and Hankel structured, noise free and unstructured blocks are allowed simultaneously in the augmented data matrix. An equivalent optimization problem is derived that has as decision variables only the estimated parameters. The cost function of the equivalent problem is used to prove consistency of the structured total least squares estimator. The results for the general affine structured multivariate model are illustrated by examples of special models. Modification of the results for block-Hankel/Toeplitz structures is also given. As a by-product of the analysis of the cost function, an iterative algorithm for the computation of the structured total least squares estimator is proposed.     

Monte Carlo Approximations of the Quantiles of a Sample Statistic

We consider in this article the problem of numerically approximating the quantiles of a sample statistic for a given population, a problem of interest in many applications, such as bootstrap confidence intervals. The proposed Monte Carlo method can be routinely applied to handle complex problems that lack analytical results. Furthermore, the method yields estimates of the quantiles of a sample statistic of any sample size though Monte Carlo simulations for only two optimally selected sample sizes are needed. An analysis of the Monte Carlo design is performed to obtain the optimal choices of these two sample sizes and the number of simulated samples required for each sample size. Theoretical results are presented for the bias and variance of the numerical method proposed. The results developed are illustrated via simulation studies for the classical problem of estimating a bivariate linear structural relationship. It is seen that the size of the simulated samples used in the Monte Carlo method does not have to be very large and the method provides a better approximation to quantiles than those based on an asymptotic normal theory for skewed sampling distributions.     

Sequential sampling without recall from a dirichlet process

The problem of sequential sampling without recall from a Dirichlet process is studied. An individual observes a sequential sample p₁, p₂, … . At each stage the observer can either accept the current value p_i or continue sampling. The total cost to the observer is the current value plus a cost for each observation taken after the first. A concrete context for the problem is provided by a shopper who must buy a particular item and can elicit price quotations sequentially but must pay for each quotation. Qualitative properties of optimal search rules are derived which establish that the problem is well behaved. In particular, the reservation-price property is shown to hold. The results extend those in Christensen (1986).     

Markov Systems in a General State Space

In this article, we introduce and study Markov systems on general spaces (MSGS) as a first step of an entire theory on the subject. Also, all the concepts and basic results needed for this scope are given and analyzed. This could be thought of as an extension of the theory of a non homogeneous Markov system (NHMS) and that of a non homogeneous semi-Markov system on countable spaces, which has realized an interesting growth in the last thirty years. In addition, we study the asymptotic behaviour or ergodicity of Markov systems on general state spaces. The problem of asymptotic behaviour of Markov chains has been central for finite or countable spaces since the foundation of the subject. It has also been basic in the theory of NHMS and NHSMS. Two basic theorems are provided in answering the important problem of the asymptotic distribution of the population of the memberships of a Markov system that lives in the general space (X, ?(X)). Finally, we study the total variability from the invariant measure of the Markov system given that there exists an asymptotic behaviour. We prove a theorem which states that the total variation is finite. This problem is known also as the coupling problem.     

Estimating the fundamental frequency of a periodic function

In this paper we consider the problem of estimation of the fundamental frequency of a periodic function, which has several applications in Speech Signal Processing. The problem was originally proposed by Hannan (1974) and later on Quinn and Thomson (1991) provided an estimation procedure of the unknown parameters. It is observed that the estimation procedure of Quinn and Thomson (1991) is quite involved numerically. In this paper we propose to use two simple estimators and it is observed that their performance are quite satisfactory. Asymptotic properties of the proposed estimators are obtained. The large sample properties of the estimators are compared theoretically. We present some simulation results to compare their small sample performance. One speech data is analyzed using this particular model.     

Optimal sequential estimation procedures of a function of a probability of success under LINEX loss

In this paper, we investigate the problem of estimating a function g(p), where p is the probability of success in a sequential sample of independent identically Bernoulli distributed random variables. As a loss associated with estimation we introduce a generalized LINEX loss function. We construct a sequential procedure possessing some asymptotically optimal properties in the case when p tends to zero. In this approach to the problem, the conditions are given, under which the stopping time is asymptotically efficient and normal, and the corresponding sequential estimator is asymptotically normal. The procedure constructed guarantees that its sequential risk is asymptotically equal to a prescribed constant.     

Simultaneous Inferences on the Cumulative Distribution Function of a Normal Distribution

This paper addresses the problem of constructing simultaneous confidence intervals for the cumulative distribution function of a normal distribution at several specified points. The procedure is based upon the observation of a random sample of independent observations from a normal distribution with an unknown mean and variance. A new methodology is proposed for obtaining confidence intervals with a specified overall simultaneous confidence level through the inversion of acceptance sets. Both one-sided and two-sided confidence intervals are considered. Some illustrations of the new method are provided, and comparisons are made with other approaches to the problem.