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 11 of 11 for “"Hessian approximation"”.

  1. How to descend a rocky slope : numerical techniques for the solution of noisy optimization problems

    … means of incrementally updating the new inverse Hessian approximation with a controlled amount of bias towards the previous inverse Hessian approximation, which allows one to replace the overwriting nature of the original BFGS update with an averaging nature that resists the destructive effects …

    ubc Repository record for How to descend a rocky slope : numerical techniques for the solution of noisy optimization problems (opens in a new tab) Download PDF for How to descend a rocky slope : numerical techniques for the solution of noisy optimization problems (opens in a new tab)

  2. Accelerating seismic inversion and uncertainty quantification with efficient high-rank Hessian approximations

    Efficient high-rank approximations of the Hessian (normal operator) can accelerate seismic full-waveform inversion (FWI) and uncertainty quantification (UQ). In FWI, the Hessian encodes the local curvature of the FWI objective function. Approximations of the inverse of the Hessian may be used as a …

    texas Repository record for Accelerating seismic inversion and uncertainty quantification with efficient high-rank Hessian approximations (opens in a new tab)

  3. Computational techniques for analysis of mixed signals

    … accelerated descent with momentum and Hessian approximation, rescaling to enforce constraints rather than Euclidean projections, and a multiscale optimization framework. Importantly, these advancements reach beyond signal demixing and into the fields of numerical analysis, operations …

    ubc Repository record for Computational techniques for analysis of mixed signals (opens in a new tab) Download PDF for Computational techniques for analysis of mixed signals (opens in a new tab)

  4. Numerical analysis for derivative-free optimization

    … methods often approximate the gradient or the Hessian of the objective function. The properties of the gradient approximation technique called generalized simplex gradient are scrutinized. Second, two Hessian approximation techniques called generalized simplex Hessian (GSH) and generalized …

    ubc Repository record for Numerical analysis for derivative-free optimization (opens in a new tab) Download PDF for Numerical analysis for derivative-free optimization (opens in a new tab)

  5. Novel Optimization Schemes for Full Waveform Inversion: Optimal Transport and Inexact Gradient Projection

    … onto convex sets algorithm. Also, the L-BFGS Hessian approximation and the above constraint set expanding strategy are used. Numerical examples show that the proposed optimization scheme is flexible for integrating multiple types of constraint sets such as total variation constraint, sparsity …

    calgary Repository record for Novel Optimization Schemes for Full Waveform Inversion: Optimal Transport and Inexact Gradient Projection (opens in a new tab)

  6. Generalised Discriminative Optimisation Algorithms for Augmented Reality: Theory and Practice.

    … and the large storage requirement for inverse Hessian approximation, which is common when using traditional optimisation methods. This thesis explores learning-based optimisation methods for point cloud registration with the aim for augmented reality applications. Three methods and a …

    bournemouth Download PDF for Generalised Discriminative Optimisation Algorithms for Augmented Reality: Theory and Practice. (opens in a new tab)

  7. Efficient Hessian computation in inverse problems with application to uncertainty quantification

    This thesis considers the efficient Hessian computation in inverse problems with specific application to the elastography inverse problem. Inverse problems use measurements of observable parameters to infer information about model parameters, and tend to be ill-posed. They are typically formulated …

    bu Repository record for Efficient Hessian computation in inverse problems with application to uncertainty quantification (opens in a new tab) Embargoed until 2999-01-01

  8. Automated optimization of polymer extrusion dies using finite element analysis

    … trust region a discreet derivative and a BFGS Hessian approximation were used. To deal with the noise in the function the trust region method was modified to automatically adjust the discreet derivative step size and the trust region based on changes in noise and function contour. Generally …

    mtu Repository record for Automated optimization of polymer extrusion dies using finite element analysis (opens in a new tab)

  9. On the use of function values to improve Quasi-Newton methods

    … the maintenance of positive-definiteness of the Hessian approximation, which property plays a very important role in the convergence of the algorithms. In chapter 7, we present numerical results for the new algorithms described in chapter 5 and 6. In order to assess the results, we have compared …

    essex Download PDF for On the use of function values to improve Quasi-Newton methods (opens in a new tab)

  10. Designing optimization algorithms through the lens of online learning

    … only through local queries such as gradients and Hessians, which can often be efficiently computed via automatic differentiation in modern machine learning applications. Thus, a fundamental question is how many such oracle queries are required before reaching a desired accuracy. In this …

    texas Repository record for Designing optimization algorithms through the lens of online learning (opens in a new tab)

  11. Uncalibrated robotic visual servo tracking for large residual problems

    … literature. For large residual problems various Hessian approximations are introduced including an approximation of the entire Hessian matrix, the dynamic BFGS (DBFGS) algorithm, and two distinct approximations of the residual term, the modified BFGS (MBFGS) algorithm and the dynamic full Newton …

    gatech Repository record for Uncalibrated robotic visual servo tracking for large residual problems (opens in a new tab)