Algorithmic complexity: threeNP- hard problems in computational statistics
From MaRDI portal
Publication:3940795
DOI10.1080/00949658208810560zbMath0482.65080OpenAlexW2089783325MaRDI QIDQ3940795
Publication date: 1982
Published in: Journal of Statistical Computation and Simulation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00949658208810560
design of experimentssubset selectionalgorithmic complexityNP-hardcluster analysisNP-completeregressionD-optimal
Classification and discrimination; cluster analysis (statistical aspects) (62H30) Analysis of algorithms and problem complexity (68Q25) General nonlinear regression (62J02) Probabilistic methods, stochastic differential equations (65C99)
Related Items
Generalized maximum-entropy sampling ⋮ Optimal design of large-scale screening experiments: a critical look at the coordinate-exchange algorithm ⋮ Cluster analysis and mathematical programming ⋮ A polynomial case of the cardinality-constrained quadratic optimization problem ⋮ An algorithm based on semidefinite programming for finding minimax optimal designs ⋮ A Nonconvex Optimization Approach to IMRT Planning with Dose–Volume Constraints ⋮ The weighted sum of split and diameter clustering ⋮ A Local Search Framework for Experimental Design ⋮ \( \mathcal{G} \)-LIME: statistical learning for local interpretations of deep neural networks using global priors ⋮ Adaptive grid semidefinite programming for finding optimal designs ⋮ Multidimensional sum-up rounding for integer programming in optimal experimental design ⋮ Efficient algorithms for divisive hierarchical clustering with the diameter criterion ⋮ Near-optimal discrete optimization for experimental design: a regret minimization approach ⋮ A greedy feature selection algorithm for big data of high dimensionality ⋮ Complexity of penalized likelihood estimation ⋮ Genetic clustering algorithms. ⋮ A whale optimization algorithm (WOA) approach for clustering ⋮ Minimum sum of diameters clustering ⋮ Subset Selection in Sparse Matrices ⋮ Approximation Algorithms for D-optimal Design ⋮ Efficient computational algorithms for approximate optimal designs ⋮ A branch-and-bound algorithm for the exact optimal experimental design problem ⋮ Generation of collocation points in the method of fundamental solutions for 2D Laplace's equation ⋮ OWA fuzzy regression ⋮ Set partition by globally optimized cluster seed points
Cites Work
