Assuming elliptically contoured distribution for portfolio asset returns, we derive the exact marginal and joint densities of the global minimum variance portfolio variance, and weights estimators. We also construct a test for the hypothesis that the global minimum variance is less then or equal to a certain value. A stochastic representation and moments of its estimator is provided. We illustr...

Two well known optimization algorithms, the Genetic Algorithm (GA) and the Simulated Annealing Algorithm (SAA), are investigated for IIR adaptive phase equalizers. For non-convex error surfaces, gradient-based algorithms often fail to find the global optimum. This work compares the ability of the GA and the SAA to achieve the global minimum solution for multi-order all-pass adaptive filters to ...

This paper provides a high-level overview of the pillar two global minimum tax in terms its policy objectives, technical design, and implications for Canada. After teasing out some significant known unknown challenges, offers thoughts on whether and, if so, how when Canada should proceed with implementation.

A new deterministic method for solving a global optimization problem is proposed. The proposed method consists of three phases. The first phase is a typical local search to compute a local minimum. The second phase employs a discrete sup-local search to locate a so-called sup-local minimum taking the lowest objective value among the neighboring local minima. The third phase is an attractor-base...

Let G = (V (G), E(G)) be a graph, and let k ≥ 1 be an integer. A set S ⊆ V (G) is called a global offensive k-alliance if |N(v) ∩ S| ≥ |N(v)−S|+k for every v ∈ V (G)−S, where N(v) is the neighborhood of v. The global offensive k-alliance number γ o (G) is the minimum cardinality of a global offensive k-alliance in G. We present different bounds on γ o (G) in terms of order, maximum degree, inde...