Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 14 of 14 for “"ellipsoid method"”.

  1. Determination of static and dynamic deformations on the surface and the interior of transparent objects using holographic interferometry

    … evaluation was made according to the "mirror method" and the "translucence method," both developed by Schoenebeck and based on Abramson's "ellipsoid method," as well as the "combined mirror and translucence method." The spatial deformations of the diffuse reflecting surface and interior planes …

    ttu Repository record for Determination of static and dynamic deformations on the surface and the interior of transparent objects using holographic interferometry (opens in a new tab)

  2. An Algorithm for Reliable Shortest Path Problem with Travel Time Correlations

    … projection, a novel one based on the deep-cut ellipsoid method is proposed as well. Numerical experiments on large-scale networks show the efficiency of the algorithm in terms of relative duality gap and computational time. Besides, there is evidence showing that, though having longer …

    umn Repository record for An Algorithm for Reliable Shortest Path Problem with Travel Time Correlations (opens in a new tab)

  3. Fast computation of minimum distance among convex 3D objects

    … systems. Many control and motion planning methods use some form of distance metric to determine how close the manipulator is to its environment. As a result, rapid calculation of distances between robot components and workspace obstacles is crucial to efforts in on-line collision avoidance. …

    uvic Repository record for Fast computation of minimum distance among convex 3D objects (opens in a new tab)

  4. Approximation Algorithms for Distributionally Robust Stochastic Optimization

    … utilize the sample average approximation (SAA) method (solve the distributionally robust problem with an empirical estimate of the central distribution) to reduce the problem to the case where the central distribution has a polynomial-size support, and is represented explicitly. This follows …

    waterloo Repository record for Approximation Algorithms for Distributionally Robust Stochastic Optimization (opens in a new tab)

  5. More homology flows

    Flows and cuts have been the topic of much study since Ford and Fulkerson's original paper. The problem we look at is the computation of flows on some generalizations of planar graphs. In particular, the input graph can be embedded on a surface of genus g, and has the source and sink on the same …

    uiuc Repository record for More homology flows (opens in a new tab)

  6. Fast 3D Model Reconstruction of the Knee Articular Cartilage and Automatic Detection of Chondral Damage/Osteoarthritic Craters using Image Processing Methodologies

    … and user-friendly semi-automatic segmentation method which we term the “Region-Based Segmentation and Bounding Box” (RBS&BB) method. A useful feature of this method is that it requires four mouse clicks to segment the articular cartilage from MR images. The second contribution is in the field …

    auckland-ms Repository record for Fast 3D Model Reconstruction of the Knee Articular Cartilage and Automatic Detection of Chondral Damage/Osteoarthritic Craters using Image Processing Methodologies (opens in a new tab)

  7. Identification and Control of Nonlinear Singularly Perturbed Systems Using Multi-time-scale Neural Networks

    … neural network and optimal bounded ellipsoid method is proposed firstly. Compared with other gradient descent based identification schemes, the new identification method proposed in this research can achieve faster convergence and higher accuracy due to the adaptively adjusted …

    concordia Download PDF for Identification and Control of Nonlinear Singularly Perturbed Systems Using Multi-time-scale Neural Networks (opens in a new tab)

  8. MULTI MODALITY IMAGING APPROACHES TO INJECTION-SITE SARCOMA IN CATS

    … with higher tumour volumes detected via the ellipsoid method. Lower tumour volumes showed slightly decreased muscular infiltration. In conclusion, the dynamic approach should be performed for a complete evaluation of the invasiveness of the ISS along with an appropriate selection of tumour …

    milano Repository record for MULTI MODALITY IMAGING APPROACHES TO INJECTION-SITE SARCOMA IN CATS (opens in a new tab)

  9. Integer programming, lattice algorithms, and deterministic volume estimation

    … The second subject of study is that of ellipsoidal approximation of convex bodies. Different such notions have been important to the development of fundamental geometric algorithms: e.g. the ellipsoid method for convex optimization (enclosing ellipsoids), or random walk methods for …

    gatech Repository record for Integer programming, lattice algorithms, and deterministic volume estimation (opens in a new tab)

  10. Convex Optimization Over Integer Points

    … Schrijver designed a unified framework using the ellipsoid method to establish the polynomial solvability of a broad range of combinatorial optimization problems. When the integer minimizer condition fails, the problem typically becomes computationally intractable, as witnessed by the NP-Hardness …

    washington Repository record for Convex Optimization Over Integer Points (opens in a new tab)

  11. Formal verification and validation of convex optimization algorithms for model predictive control

    The efficiency of modern optimization methods, coupled with increasing computational resources, has led to the possibility of real-time optimization algorithms acting in safety critical roles. However, this cannot happen without addressing proper attention to the soundness of these algorithms. This …

    gatech Repository record for Formal verification and validation of convex optimization algorithms for model predictive control (opens in a new tab)

  12. Calibration-free localization using time differences of arrival

    … robust closed-form algorithms. We propose the Ellipsoid TDoA method, which relies on the fact that TDoA measurements from three receivers in the plane form an ellipse. This ellipse is robustly determined by regression, and the distances and angles between the receivers are calculated from the …

    freiburg-diss Repository record for Calibration-free localization using time differences of arrival (opens in a new tab)

  13. Some Algorithms for Large-Scale Linear and Convex Minimization in Relative Scale

    … relative error $\delta$ of the optimum. The methods we propose converge in $O(1/\delta^2)$ or $O(1/\delta)$ iterations of a first-order type. While the theoretical lower iteration bound for approximately solving (in the absolute sense) nonsmooth convex minimization problems in the black-box …

    cornell Repository record for Some Algorithms for Large-Scale Linear and Convex Minimization in Relative Scale (opens in a new tab)