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 128 for “"BFGS"”.

  1. Updating conjugate directions by the BFGS formula with variable storage

    … be updated in a similar way to updating H by the BFGS formula. The advantage of using Z is that ZZᵀ remains positive definite despite accumulated roundoff errors during the iterations, which is important to keep good accuracy for those problems that are very sensitive to roundoff errors. The …

    uvic Repository record for Updating conjugate directions by the BFGS formula with variable storage (opens in a new tab)

  2. Historical development of the BFGS secant method and its characterization properties

    The BFGS secant method is the preferred secant method for finite-dimensional unconstrained optimization. The first part of this research consists of recounting the historical development of secant methods in general and the BFGS secant method in particular. Many people believe that the secant …

    rice Repository record for Historical development of the BFGS secant method and its characterization properties (opens in a new tab)

  3. Using complex step numerical differentiation in the Broyden-Fletcher-Goldfard-Shanno algorithm

    … to the Broyden–Fletcher–Goldfarb–Shanno (BFGS) algorithm. We apply different gradient approximation strategies on the BFGS, particularly a complex-step method to the gradient approximation. We conduct an experiment to test the feasibility of the approximation-based-BFGS methods. The …

    ubc Repository record for Using complex step numerical differentiation in the Broyden-Fletcher-Goldfard-Shanno algorithm (opens in a new tab) Download PDF for Using complex step numerical differentiation in the Broyden-Fletcher-Goldfard-Shanno algorithm (opens in a new tab)

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

    … penalized Broyden-Fletcher-Goldfarb-Shanno (SP-BFGS), Neural Network Accelerated Implicit Filtering (NNAIF), and Linear Model Based Gradient Estimation (LMBGE). SP-BFGS is a new variant of the Broyden-Fletcher-Goldfarb-Shanno (BFGS) quasi-Newton method designed to perform well when gradient …

    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)

  5. Theory And Algorithms For Structured Nonsmooth Optimization

    … behavior, both good and bad, of the well-known BFGS algorithm for smooth minimization, when applied to nonsmooth functions. We consider three very particular examples. We first present a simple nonsmooth example, illustrating how BFGS (in this case with an exact line search) typically succeeds …

    cornell Repository record for Theory And Algorithms For Structured Nonsmooth Optimization (opens in a new tab)

  6. Waveform-based velocity estimation from reflection seismic data

    … Hessian matrix and its inverse using a projected BFGS (P-BFGS) method. Compared to the classic limited-memory BFGS (L-BFGS) method, P-BFGS substantially saves both computational time and memory, due to fewer model parameters of the sparse model. With the P-BFGS method, I propose an efficient …

    colo-mines Repository record for Waveform-based velocity estimation from reflection seismic data (opens in a new tab)

  7. Stochastic second-order optimization for over-parameterized machine learning models

    … functions. Furthermore, we analyze stochastic BFGS algorithms in the interpolation setting and prove their global linear convergence. We empirically evaluate stochastic limited-memory BFGS (L-BFGS) and a “Hessian-free” implementation of R-SSN for binary classification on synthetic, …

    ubc Repository record for Stochastic second-order optimization for over-parameterized machine learning models (opens in a new tab) Download PDF for Stochastic second-order optimization for over-parameterized machine learning models (opens in a new tab)

  8. SMOOTH QUASI-NEWTON METHODS FOR NONSMOOTH OPTIMIZATION

    … the popular Broyden-Fletcher- Goldfarb-Shanno (BFGS) quasi-Newton method for smooth convex functions in fact extends to some nonsmooth settings. Secondly, removing the influence of linesearch techniques and introducing linesearch-free quasi-Newton approaches (including a version of Shor’s R …

    cornell Repository record for SMOOTH QUASI-NEWTON METHODS FOR NONSMOOTH OPTIMIZATION (opens in a new tab)

  9. Improved algorithms for image super-resolution

    … (DFP) and Broyden-Fletcher-Goldfarb-Shanno (BFGS) algorithms are appropriately reformulated to cope with the large-scale nature of the SR problem and are then applied to the SR schemes. Experimental results show that by means of the proposed algorithms, grayscale reconstruction is …

    uvic Repository record for Improved algorithms for image super-resolution (opens in a new tab)

  10. Uncalibrated robotic visual servo tracking for large residual problems

    … 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 method with BFGS (DFN-BFGS) algorithm. Due to the fact that the quasi-Gauss-Newton method has the advantage …

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

  11. STOCHASTIC AND RANDOMIZED ALGORITHMS FOR LARGE-SCALE OPTIMIZATION IN MACHINE LEARNING

    … Broyden-Fletcher-Goldfarb-Shanno (L-BFGS) algorithm for strongly convex smooth optimization. By proposing a new coordinate transformation framework, we show that the convergence rates and computational complexities of the stochastic L-BFGS algorithms can be significantly improved …

    nus Repository record for STOCHASTIC AND RANDOMIZED ALGORITHMS FOR LARGE-SCALE OPTIMIZATION IN MACHINE LEARNING (opens in a new tab) Download file for STOCHASTIC AND RANDOMIZED ALGORITHMS FOR LARGE-SCALE OPTIMIZATION IN MACHINE LEARNING (opens in a new tab)

  12. Local and superlinear convergence of structured secant methods from the convex class

    … of these methods are the SQP augmented scale BFGS and DFP secant methods for constrained optimization problems introduced by Tapia. Another particular case, for which local and q-superlinear convergence is proved for the first time here, is the Al-Baali and Fletcher modification of the …

    rice Repository record for Local and superlinear convergence of structured secant methods from the convex class (opens in a new tab)

  13. Data Reduction Procedure for an Experimental Method of Measuring the Velocity-Coupled Response Function of Solid Propellants

    … consists of a Runge-Kutta routine driven by a BFGS multivariable search routine. The Runge-Kutta routine determines the pressure distribution within the chamber of the proposed apparatus for a specific velocity-coupled response function (Rv). The BFGS optimization routine searches for the Rv …

    embry-riddle Repository record for Data Reduction Procedure for an Experimental Method of Measuring the Velocity-Coupled Response Function of Solid Propellants (opens in a new tab)

  14. IMPROVED TRAINING OF DEEP NETWORKS FOR COMPUTER VISION

    … of deep networks, we explore the use of L-BFGS for large-scale machine learning applications. L-BFGS, a very successful second- order optimization method for convex problems, is not even considered an algorithm of choice for these applications. Recent work has shown that a stochastic …

    maryland Repository record for IMPROVED TRAINING OF DEEP NETWORKS FOR COMPUTER VISION (opens in a new tab)

  15. An energy landscaping approach to the protein folding problem

    … (QNA), and the Broyden-Fletcher-Goldfarb-Shanno (BFGS) algorithm. The XEL changes the heights and the depths of the extrema but keeps their location the same, which eliminates the troublesome process of remapping minima onto the original landscape. The Newton-XEL is found to have a similar …

    gatech Repository record for An energy landscaping approach to the protein folding problem (opens in a new tab)

  16. A Hamiltonian Systems Approach to Neural Network Optimization

    … DG updates and incorporating curvature through L-BFGS Hessian approximations, which are used to efficiently solve the result- ing linear systems. These schemes retain key structure-preserving properties while significantly reducing computational cost, yielding a practical balance between stability …

    waterloo Repository record for A Hamiltonian Systems Approach to Neural Network Optimization (opens in a new tab)

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

    … on manifolds. In 1982, Gabay proposed a BFGS algorithm (which is a popular quasi-Newton algorithm) to Riemannian manifolds. The convergence proof was not completed. This thesis will continue his attempts on the proof of convergence results. A more challenging task will be brought to …

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

  18. Epidemiologické modelování šíření nemoci Covid-19

    … prostoru parametrů implementací algoritmu BFGS.

    brno-tech Repository record for Epidemiologické modelování šíření nemoci Covid-19 (opens in a new tab)

Page 1 of 7