«ellipsoid algorithm»
۱۲۳۳ نتیجهEecient Algorithms for Geometric Optimization
Linear Programming 15 after kd successful rounds, 2k (H) nek=3. This implies that the above algorithm terminates in at most 3d lnn successful rounds. Since each round takes O(dd) time to compute xR and O(dn) time to compute V , the expected running time of the algorithm is O((d2n
Improving the Efficiency of Genetic Algorithms for Constrained Optimization
The efficiency of a Genetic Algorithm for constrained parameter optimization depends heavily on the ratio of feasible to infeasible area in its rectangular search space. We show an algorithm based on existing mathematical programming methods which improves this ratio assuming a s
Eecient Algorithms for Geometric Optimization Eecient Algorithms for Geometric Optimization
Linear Programming 15 contain such a constraint), which implies that after kd iterations (H) (B) 2k. Hence, after kd successful rounds, 2k (H) nek=3. This implies that the above algorithm terminates in at most 3d lnn successful rounds. Since each round takes O(dd) time to compute
A Fuzzy Classifier with Evolutionary Design of Ellipsoidal Decision Regions
A fuzzy classifier using multiple ellipsoids approximating decision regions for classification is to be designed in this paper. An algorithm called Gustafson-Kessel algorithm (GKA) with an adaptive distance norm based on covariance matrices of prototype data points is adopted to
Multivariate Gaussian Simulation Outside Arbitrary Ellipsoids
Methods for simulation from multivariate Gaussian distributions restricted to be from outside an arbitrary ellipsoidal region are often needed in applications. A standard rejection algorithm that draws a sample from a multivariate Gaussian distribution and accepts it if it is out
Conditional Minimum Volume Ellipsoid with Applications to Subset Selection for MVE Estimator and Multiclass Discrimination
In this paper, we present a new formulation for constructing an ellipsoid which generalizes the computation of the minimum volume covering ellipsoid, based on the CVaR minimization technique proposed by Rockafellar and Uryasev (2002). The proposed ellipsoid construction is formul
Parallel collision detection of ellipsoids with applications in large scale multibody dynamics
This contribution describes a parallel approach for determining the collision state of a large collection of ellipsoids. Collision detection is required in granular dynamics simulation where it can combine with a differential variational inequality solver or discrete element meth
On Khachiyan's algorithm for the computation of minimum-volume enclosing ellipsoids
Given A := {a1, . . . , am} ⊂ Rd whose affine hull is Rd, we study the problems of computing an approximate rounding of the convex hull of A and an approximation to the minimum volume enclosing ellipsoid of A. In the case of centrally symmetric sets, we first establish that Khach
Ellipsoids for Anomaly Detection in Remote Sensing Imagery
For many target and anomaly detection algorithms, a key step is the estimation of a centroid (relatively easy) and a covariance matrix (somewhat harder) that characterize the background clutter. For a background that can be modeled as a multivariate Gaussian, the centroid and cov
CSC 2411 - Linear Programming and Combinatorial Optimization ∗ Lecture 6 : The Ellipsoid Method
This lecture introduces the Ellipsoid Method, the first polynomialtime algorithm to solve LP. We start by discussing the historical significance of its discovery by L. Khachiyan. Next, we argue that the ability to decide the feasibility of a version of the constraints of an LP is