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 “"Newton algorithms"”.

  1. Quasi-Newton algorithms for large scale nonlinear systems

    In this work, an evaluation of a number of quasi-Newton algorithms and strategies for sparse, symmetric Hessian matrices was performed. It was shown how these quasi-Newton algorithms could be applied to the unconstrained minimization of a nonlinear function as well as a nonlinear least squares …

    vt Repository record for Quasi-Newton algorithms for large scale nonlinear systems (opens in a new tab)

  2. Tracking on manifolds : quasi-Newton optimisation algorithms on manifolds

    … Many traditional unconstrained optimisation algorithms such as the steepest descent algorithm, the Newton's method and the trust region algorithm have be extended to Riemannian manifolds or smooth manifolds. However, little work has been done in quasi-Newton algorithms on manifolds. In 1982, …

    anu Repository record for Tracking on manifolds : quasi-Newton optimisation algorithms on manifolds (opens in a new tab)

  3. Mixed regression models for discrete data

    … estimation methods based on the EM and quasi-Newton algorithms, properties of these estimates, model selection criteria and residual analysis are discussed. A Monte Carlo study investigates implementation and model choice issues. Several applications of this approach are analyzed. This …

    ubc Repository record for Mixed regression models for discrete data (opens in a new tab) Download PDF for Mixed regression models for discrete data (opens in a new tab)

  4. New formulation of the load-flow problem

    … in each equation for an n-bus power system. Five algorithms based upon the new formulation are described. Numerical tests on several sample power systems show that some of the new algorithms possess better convergence and speed characteristics than the commonly used Ward-Hale and Newton algorithms.

    ubc Repository record for New formulation of the load-flow problem (opens in a new tab) Download PDF for New formulation of the load-flow problem (opens in a new tab)

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

    … widely-used class of methods, namely, the "quasi-Newton" algorithms. The material of this thesis is organized into seven chapters. The first three chapters are devoted to a survey of existing methods for the unconstrained problem while, in the remainder of the thesis, we investigate new techniques …

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

  6. Non-asymptotic study of quasi-Newton methods with application in large-scale machine learning

    Quasi-Newton methods are among popular optimization algorithms for solving convex programs since they serve as a middle ground between first-order methods and second-order Newton-type algorithms. They improve the linear convergence rate of first-order methods and achieve a local superlinear rate, …

    texas Repository record for Non-asymptotic study of quasi-Newton methods with application in large-scale machine learning (opens in a new tab)

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

    … may be used as a preconditioner for inexact Newton-Krylov algorithms or quasi-Newton algorithms, significantly reducing computational costs and improving recovery in deeper subsurface regions. In Bayesian UQ, the inverse of the Hessian is the covariance of a local Gaussian approximation to …

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

  8. Online Convex Optimization in Changing Environments and its Application to Resource Allocation

    … attracted lots of researchers to develop useful algorithms to fulfill different needs. In this thesis, we show our contributions to OCO’s development by designing algorithms to adapt to changing environments. In the first part of the thesis, we propose algorithms to have better adaptivity by …

    umn Repository record for Online Convex Optimization in Changing Environments and its Application to Resource Allocation (opens in a new tab)