New exchange algorithms which generalize the NOA algorithm of Nguyen [1996. An algorithmic approach to constructing supersaturated designs. Technometrics 38, 69鈥 73] and which tend to find E(s2)-optimal designs
Worst, average, and best-case complexity.Often, not all problem instances require the same amount of resources (space or time) to be solved by the same program/algorithm.Worst case complexityrefers to the cost of the worst (most expensive) instance of the problem when solved by the best pos...
Schmidt, “On an algorithm solving two-level programming problems with nonunique lower level solutions,” Comput. Optim. Appl., 6, 227–249 (1995). Google Scholar V. F. Demyanov, Minimax:Directional Differentiability [in Russian], Leningrad University Press, Leningrad (1974). Google Scholar ...
The search method through the function space is defined by: (1) the regression algorithm or technique and (2) the set of parameters related to the search for the learned function f not part of its definition. The targeted variables for the regressors are the concrete properties tackled within...
We also prove the near-minimax optimality of the adaptive lasso shrinkage using the language of Donoho and Johnstone (1994). The adaptive lasso is essentially a con- vex optimization problem with an 1 constraint. Therefore, the adaptive lasso can be solved by the same efficient algorithm ...
Minimax optimalityReproducibilityStabilityThe stability of statistical analysis is an important indicator for reproducibility, which is one main principle of the scientific method. It entails that similar statistical conclusions can be reached based on independent samples from the same underlying population. ...
Gompertz software reliability model: Estimation algorithm and empirical validation. J. Syst. Softw. 2009, 82, 535–543. [Google Scholar] [CrossRef] [Green Version] Bemmaor, A.C.; Glady, N. Modeling Purchasing Behavior With Sudden ‘Death’: A Flexible Customer Lifetime Model. Manag. Sci....
Despite these improvements, the effectiveness of CS methods in reconstructing spectra containing synchronous vibrations remained limited. To address this issue Dong et al. [45,46] recently introduced the subspace pursuit algorithm. This recovery algorithm overcomes challenges related to selecting valid ...
Unfortunately, the solution of this optimization problem, known as the "minimum infinity-norm solution", cannot be expressed in a closed form in general thus requiring the use of an algorithm to iteratively refine an initial guess before re...
Instead of the filter structure, we adopt a nonmonotonic equilibrium mechanism with an adaptive parameter adjusted according to the result of each iteration. Feasibility of the algorithm are given, and the convergence under some assumptions is demonstrated. Numerical results and...