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 20 of 41 for “"Gradient Based Algorithms"”.

  1. On Convergence Analysis of Stochastic and Distributed Gradient-Based Algorithms

    … the existing stochastic methods and develop the algorithms and theory to solve the unconstrained distributed optimization problem. For stochastic adaptive gradient-based methods, including RMSprop, Adadelta, Adam, AdaGrad, Nadam, and AMSgrad, which are popular stochastic optimization methods …

    waterloo Repository record for On Convergence Analysis of Stochastic and Distributed Gradient-Based Algorithms (opens in a new tab)

  2. Permeability Distribution Estimation Based on Semi-Analytical Reservoir Simulator

    … simulator, the choice of optimization algorithms to minimize the objective function becomes of vital importance. For our simulator, we considered both gradient based methods and non-gradient based methods. Gradient based algorithms have the big advantage of much faster convergence rate …

    regina Repository record for Permeability Distribution Estimation Based on Semi-Analytical Reservoir Simulator (opens in a new tab) Download PDF for Permeability Distribution Estimation Based on Semi-Analytical Reservoir Simulator (opens in a new tab)

  3. Static and dynamic optimization problems in cooperative multi-agent systems

    … and resource allocation problems. It allows gradient-based algorithms to be applied to solve these problems, all of which have been studied in a separate way in the past. Gradient-based algorithms are shown to be distributed for a subclass of problems where objective functions can be …

    bu Repository record for Static and dynamic optimization problems in cooperative multi-agent systems (opens in a new tab)

  4. High-Performance Computing Methods for Electromagnetic Well Logging Inverse Problems

    … have placed more requirements on the inverse algorithms. Traditional gradient-based algorithms can solve the inverse problem in a relatively short time, however, they only find local minimums without uncertainty quantification. If uncertainty quantification is desired, Bayesian inference …

    houston Repository record for High-Performance Computing Methods for Electromagnetic Well Logging Inverse Problems (opens in a new tab)

  5. Geometry of Feedback Control and Learning

    … dynamic games, through the lens of first-order algorithms. The developed theories on these topics are largely derived from model-based dynamic programming. Recently there is a surge of interest in constructing optimal control strategies directly, viewing control synthesis by policy gradient …

    washington Repository record for Geometry of Feedback Control and Learning (opens in a new tab)

  6. ON PRINCIPAL GENERALIZED LINEAR MODELING FOR SUFFICIENT DIMENSION REDUCTION AND MODEL BUILDING

    … dimension reduction (SDR) and model building based on the generalized linear model (GLM). Our main contribution are threefold. First, we propose the principal generalized linear model (PGLM) as a general-purpose SDR method. Next, we apply PGLM and its variation profile PGLM to fit the …

    temple Repository record for ON PRINCIPAL GENERALIZED LINEAR MODELING FOR SUFFICIENT DIMENSION REDUCTION AND MODEL BUILDING (opens in a new tab)

  7. Finite Element Modeling and Multivariate Optimization Over Fibre Orientation and Volume Fraction of Fibre Composite Parts Aimed at Minimizing Targeted Displacements

    … optimization library. Both derivative-free and gradient-based algorithms were tested. Low-Storage Broyden-Fletcher-Goldfarb-Shannon was the most effective algorithm. Four more complex cases were examined, and by varying fibre orientations, reductions of 48%, 66%, 58% and 32% were achieved in …

    ottawa-retro Repository record for Finite Element Modeling and Multivariate Optimization Over Fibre Orientation and Volume Fraction of Fibre Composite Parts Aimed at Minimizing Targeted Displacements (opens in a new tab)

  8. Reservoir Flooding Optimization by Control Polynomial Approximations

    … we implemented the methods also with gradient-based algorithms. In addition to fine-scale simulation, we also performed reduced order modeling, where we demonstrated a synergistic effect when combining polynomial approximation with model order reduction, that leads to faster …

    tamu Repository record for Reservoir Flooding Optimization by Control Polynomial Approximations (opens in a new tab)

  9. Learning Approach for Fast Approximate Matrix Factorizations

    … role in data analysis. One of the most efficient algorithms for such tasks is the randomized algorithm, which proceeds by computing a projection XA with a random projection matrix A of much smaller size, and then computing the orthonormal basis as well as low-rank factorizations of the tall matrix …

    denver Repository record for Learning Approach for Fast Approximate Matrix Factorizations (opens in a new tab)

  10. The Generalized Method of Moments for Mixture and Mixed Models

    … properties: the positive representation and the gradient characterization. The positive representation reveals the identifiability of the mixing distribution by its generalized moments and provides an upper bound of the number of the support points of the mixing distribution. On the other hand, …

    waterloo Repository record for The Generalized Method of Moments for Mixture and Mixed Models (opens in a new tab)

  11. Hybrid Intelligent Optimization Methods for Engineering Problems

    … modeling of a natural phenomenon is almost based on differentials. Differential equations are constructed with relative increments among the factors related to yield. Therefore, the gradients of these increments are essential to search the yield space. However, the landscape of yield is not …

    odu Repository record for Hybrid Intelligent Optimization Methods for Engineering Problems (opens in a new tab)

  12. High-Dimensional Analysis of the Linear-Quadratic Regulator Problem Using First Order Methods on GPU

    … systems, machine learning uses large data sets based on sampled data. The differences in input data used have made it difficult to adapt optimal control concepts to machine learning applications. For example, a major challenge in utilizing a linear-quadratic regulator (LQR) is how …

    tamu Repository record for High-Dimensional Analysis of the Linear-Quadratic Regulator Problem Using First Order Methods on GPU (opens in a new tab)

  13. Statistical learning of Hawkes models and market microstructure

    … error (LSE), as well as the evaluation of their gradients, have a quadratic complexity in the number of observed events. In practice, this prohibits the use of exact gradient-based algorithms for parameter estimation in many settings. Furthermore, MHP models are not designed for non-stationary …

    oxford Repository record for Statistical learning of Hawkes models and market microstructure (opens in a new tab)

  14. Gradient-based Optimization and Control of Systems with Two Decision-makers and Delayed Information

    … process for each DM to adjust its decisions based on the direction of the gradient of its own objective function. We explore two possible alternatives in which each DM will decide to share current or past information with the other DM at every iteration in the process. These two alternatives …

    ucf Repository record for Gradient-based Optimization and Control of Systems with Two Decision-makers and Delayed Information (opens in a new tab)

  15. Hybrid And Hierarchical Image Registration Techniques

    … classified into two categories: intensity-based and feature-based methods. The primary drawback of the intensity-based approaches is that it may fail unless the two images are misaligned by a moderate difference in scale, rotation, and translation. In addition, intensity-based methods lack …

    ucf Repository record for Hybrid And Hierarchical Image Registration Techniques (opens in a new tab)

  16. Structural optimization of flexible components within a multibody dynamics approach

    … of the optimization process. Also, since gradient-based algorithms are employed, a semi-analytical method for sensitivity analysis is proposed. The weakly coupled method mimics the dynamic loading by a series of equivalent static loads (ESL) whereupon all the standard techniques of static …

    liege Repository record for Structural optimization of flexible components within a multibody dynamics approach (opens in a new tab) Download PDF for Structural optimization of flexible components within a multibody dynamics approach (opens in a new tab)

  17. Registration using Graphics Processor Unit

    … Highly efficient numerical and analytical gradient based algorithms exist and their goal is to convergence to an optimal solution in minimum time. This thesis presents a new approach to efficiently perform the registration process by employing readily available computer hardware, the …

    clemson Repository record for Registration using Graphics Processor Unit (opens in a new tab)

  18. Modeling, Sensitivity Analysis, and Optimization of Hybrid, Constrained Mechanical Systems

    … sensitivities for hybrid systems is structured based on jumping conditions for both, the velocity state variables and the sensitivities matrix. The proposed analytical approach is then benchmarked against a known numerical method. The mathematical framework is extended to compute sensitivities …

    vt Repository record for Modeling, Sensitivity Analysis, and Optimization of Hybrid, Constrained Mechanical Systems (opens in a new tab)

  19. Algorithmic Modifications to a Multidisciplinary Design Optimization Model of Containerships

    … sub-problems. But to avail the advantages of gradient-based optimization algorithms, the design problem is molded into a fully continuous problem. The efficiency and effectiveness with which an optimization process achieves the best design depends on how well the design problem is posed for …

    vt Repository record for Algorithmic Modifications to a Multidisciplinary Design Optimization Model of Containerships (opens in a new tab)

  20. Intensity Modulated Proton Therapy Optimization Under Uncertainty: Field Misalignment and Internal Organ Motion

    … healthy tissues. Compared to conventional photon-based radiation therapy, IMPT is more flexible in delivering radiation dose according to different tumor shapes. However, this flexibility also makes the optimization problems in IMPT harder to solve, e.g., it requires larger memory to store data …

    houston Repository record for Intensity Modulated Proton Therapy Optimization Under Uncertainty: Field Misalignment and Internal Organ Motion (opens in a new tab)

Page 1 of 3