Similar Search Results

The new Neyman type A beta Weibull model with long-term survivors

Hashimoto, Elizabeth; Cordeiro, Gauss; Ortega, Edwin - In: Computational Statistics 28 (2013) 3, pp. 933-954

For the first time, we propose a flexible cure rate survival model by assuming that the number of competing causes of the event of interest follows the Neyman type A distribution and the time to this event has the beta Weibull distribution. This new model can be used to analyze survival data...

Persistent link: https://www.econbiz.de/10010847691

On the influence of the prior distribution in image reconstruction

Rootzén, Holger; Olsson, Jonny - In: Computational Statistics 21 (2006) 3, pp. 431-444

Persistent link: https://www.econbiz.de/10005382520

A note on solution sensitivity for Karush–Kuhn–Tucker systems

Izmailov, A.; Solodov, M. - In: Computational Statistics 61 (2005) 3, pp. 347-363

We consider Karush-Kuhn-Tucker (KKT) systems, which depend on a parameter. Our contribution concerns with the existence of solution of the directionally perturbed KKT system, approximating the given primal-dual base solution. To our knowledge, we give the first explicit result of this kind in...

Persistent link: https://www.econbiz.de/10010759259

Optimal strategy policy in batch arrival queue with server breakdowns and multiple vacations

Ke, Jau-Chuan - In: Computational Statistics 58 (2003) 1, pp. 41-56

This paper considers a like-queue production system in which server vacations and breakdowns are possible. The decision-maker can turn a single server on at any arrival epoch or off at any service completion. We model the system by an M [x] /M/1 queueing system with N policy. The server can be...

Persistent link: https://www.econbiz.de/10010759271

Optimal purchasing policy in a two-component assembly system with different purchasing contracts for each component

Kim, Eungab; Lee, Kaphoon; Kang, Suk-Ho - In: Computational Statistics 63 (2006) 2, pp. 301-327

This paper considers an assembly system where a firm produces a single product which is assembled using two types of components (component 1 and component 2). The components are provided by individual suppliers (supplier 1 and supplier 2). We assume that the firm makes different procurement...

Persistent link: https://www.econbiz.de/10010759302

Sensitivity analysis for discrete optimal control problems

Marinković, Boban - In: Computational Statistics 63 (2006) 3, pp. 513-524

We present local sensitivity analysis for discrete optimal control problems with varying endpoints in the case when the customary regularity of boundary conditions can be violated. We study the behavior of the optimal solutions subject to parametric perturbations of the problem. Copyright...

Persistent link: https://www.econbiz.de/10010759592

A comparison of algorithms for the multivariate L <Subscript>1</Subscript>-median

Fritz, Heinrich; Filzmoser, Peter; Croux, Christophe - In: Computational Statistics 27 (2012) 3, pp. 393-410

, but also general optimization routines. The aim is to compare different algorithms with respect to their precision and … environment R. In most situations, the algorithm based on the optimization routine NLM (non-linear minimization) clearly …

Persistent link: https://www.econbiz.de/10010998479

Performance of derivative free search ANN training algorithm with time series and classification problems

Ahmed, Shamsuddin - In: Computational Statistics 28 (2013) 5, pp. 1881-1914

A Manhattan search algorithm to minimize artificial neural network error function is outlined in this paper. From an existing position in Cartesian coordinate, a search vector moves in orthogonal directions to locate minimum function value. The search algorithm computes optimized step length for...

Persistent link: https://www.econbiz.de/10010998486

Proposal adaptation in simulated annealing for continuous optimization problems

Solonen, Antti - In: Computational Statistics 28 (2013) 5, pp. 2049-2065

adaptation mechanisms can be used in Simulated Annealing (SA), a popular optimization method based on MCMC. The difficulty in … can significantly improve optimization results compared to non-adaptive SA. The approach is presented for continuous … optimization problems and generalization to integer and mixed-integer problems is a topic of future research. Copyright Springer …

Persistent link: https://www.econbiz.de/10010998510

Degeneracy degrees of constraint collections

Sierksma, Gerard; Tijssen, Gert A. - In: Computational Statistics 57 (2003) 3, pp. 437-448

This paper presents an unifying approach to the theory of degeneracy of basic feasible solutions, vertices, faces, and all subsets of polyhedra. It is a generalization of the usual concept of degeneracy defined for basic feasible solutions of an LP-problem. We use the concept of degeneracy...

Persistent link: https://www.econbiz.de/10010847504