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 55 for “"Quasi-Newton method"”.

  1. Analytical study of the Least Squares Quasi-Newton method for interaction problems

    … thesis to find, describe and analyze solution methods to solve the equations resulting from the mathematical models describing those interacting systems. Even if powerful solvers often already exist for problems in a single physical domain (e.g. structural or fluid problems), the development of …

    ghent Repository record for Analytical study of the Least Squares Quasi-Newton method for interaction problems (opens in a new tab)

  2. Location of stable and unstable equilibrium configurations using a model trust region quasi-Newton method and tunnelling

    A hybrid method consists of a quasi-Newton method and a homotopy method for locating multiple equilibrium configurations has been proposed recently. The hybrid method combined the efficiency of a quasi-Newton method capable of locating stable and unstable equilibrium solutions with a robust …

    vt Repository record for Location of stable and unstable equilibrium configurations using a model trust region quasi-Newton method and tunnelling (opens in a new tab)

  3. The updated subspaces method in optimization and in solving linear systems of equations

    The Updated Conjugate Subspaces method, an modified quasi-Newton method for solving nonlinear unconstrained minimization problems, has flexibility of choosing different quadratic approximation at each iteration and therefore has potential of improving the rate of convergence given by the …

    uiuc Repository record for The updated subspaces method in optimization and in solving linear systems of equations (opens in a new tab)

  4. Quasi-Newton Methods for Nonlinear Programming

    … a new class of symmetric updates for use in a quasi-Newton method for nonlinear programming. We show how these updates model the underlying nonlinear equation better than the standard symmetric updates and also how they require less overall work for large problems.

    uiuc Repository record for Quasi-Newton Methods for Nonlinear Programming (opens in a new tab)

  5. Inversion of airborne electromagnetic data in 2.5D

    … using the limited memory BFGS variant of the quasi-Newton method. Next, EM responses from a synthetic 2D conductivity model are inverted to validate the algorithm. Finally, we use the algorithm on an AEM field dataset from a RESOLVE survey and compare the inversion results to those obtained …

    ubc Repository record for Inversion of airborne electromagnetic data in 2.5D (opens in a new tab) Download PDF for Inversion of airborne electromagnetic data in 2.5D (opens in a new tab)

  6. Topics in quasi-Newton and space-time spectral methods

    The first part of this thesis focuses on quasi-Newton methods. Broyden's method is a quasi-Newton method which is used to solve a system of nonlinear equations. Almost all convergence theory in the literature assumes existence of a root and bounds on the nonlinear function and its derivative in …

    manitoba Repository record for Topics in quasi-Newton and space-time spectral methods (opens in a new tab)

  7. Uncalibrated robotic visual servo tracking for large residual problems

    … uncalibrated visual servoing algorithms use quasi-Gauss-Newton methods which are effective for small residual problems. The solution used in this study switches between a full quasi-Newton method for large residual case and the quasi-Gauss-Newton methods for the small case. Visual servoing to …

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

  8. Approximating stable densities with Padé approximants and asymptotic series

    … confidence interval of the parameters, using quasi-Newton method. Simulations are conducted to evaluate the performance of this algorithm, and comparisons are made to Nolan's integral method to show that the method introduced in the thesis is fast and reliable in approximation and estimation.

    waterloo Repository record for Approximating stable densities with Padé approximants and asymptotic series (opens in a new tab)

  9. ANALYSIS OF NONNEGATIVE LEAST SQUARES ALGORITHMS

    … to solve such a problem like the active set method by Lawson and Hanson, FNNLS by Bro and Jong, the Quasi-Newton minimization method, and Randomized projections methods. In this thesis, we evaluated the performance properties of all these algorithms by implementing them in MATLAB and compared …

    tamu Repository record for ANALYSIS OF NONNEGATIVE LEAST SQUARES ALGORITHMS (opens in a new tab)

  10. A modified augmented Lagrangian merit function, and Q-superlinear characterization results for primal-dual Quasi-Newton interior-point method for nonlinear programming

    Two classes of primal-dual interior-point methods for nonlinear programming are studied. The first class corresponds to a path-following Newton method formulated in terms of the nonnegative variables rather than all primal and dual variables. The centrality condition is a relaxation of the …

    rice Repository record for A modified augmented Lagrangian merit function, and Q-superlinear characterization results for primal-dual Quasi-Newton interior-point method for nonlinear programming (opens in a new tab)

  11. MAXIMIZING THE RANGE OF A GLIDER

    This thesis reports the methodology and result obtained from studying the optimal trajectory which will maximize the range of a simple aircraft-like gliding projectile model. Previous work done on the same glider model is reported in reference (1). Control Parametrization technique and Quasi Newton …

    nus Repository record for MAXIMIZING THE RANGE OF A GLIDER (opens in a new tab) Download file for MAXIMIZING THE RANGE OF A GLIDER (opens in a new tab)

  12. SELF-SCALING PARALLEL QUASI-NEWTON METHODS FOR NONLINEAR UNCONSTRAINED OPTIMIZATION

    Quasi-Newton (QN) methods are generally considered to be the most efficient algorithms for solving medium-sized problems (with 100 - 500 variables). Currently there are many different updates existed in the literature. But none of them alone can be efficiently applied to solve all types of …

    nus Repository record for SELF-SCALING PARALLEL QUASI-NEWTON METHODS FOR NONLINEAR UNCONSTRAINED OPTIMIZATION (opens in a new tab) Download file for SELF-SCALING PARALLEL QUASI-NEWTON METHODS FOR NONLINEAR UNCONSTRAINED OPTIMIZATION (opens in a new tab)

  13. Direct minimization and acceleration of electronic structure calculations

    This dissertation investigates numerical methods for direct minimization and acceleration of electronic structure calculations. The focus is on methods for Kohn-Sham density functional theory and its extension to fractionally occupied electronic orbitals. The methods are derived in the setting of …

    aalto Repository record for Direct minimization and acceleration of electronic structure calculations (opens in a new tab)

  14. SMOOTH QUASI-NEWTON METHODS FOR NONSMOOTH OPTIMIZATION

    The success of Newton’s method for smooth optimization, when Hessians are available, motivated the idea of quasi-Newton methods, which approximate Hessians in response to changes in gradients and result in superlinear convergence on smooth functions. Sporadic informal observations over several …

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

  15. Energy management for a multiple-pulse missile

    … problem which is solved using a second-order, quasi-Newton method with constraint projection. The two solutions are found to compare well. This result allows confidence in the use of the nonlinear-programming technique to solve optimization problems in flight mechanics for which no analytical …

    vt Repository record for Energy management for a multiple-pulse missile (opens in a new tab)

  16. Convergence Analysis of Generalized Primal-Dual Interior-Point Algorithms for Linear Optimization

    … of the classic primal-dual affine-scaling methods, and have a strong connection with the quasi-Newton method. Although the zeroth-order algorithms have the property of strict monotone decrease in both primal and dual objective values, they may not converge. We give an illustrative example …

    waterloo Repository record for Convergence Analysis of Generalized Primal-Dual Interior-Point Algorithms for Linear Optimization (opens in a new tab)

  17. Kinetic modeling and parameter optimization of iodine hydrolysis reactions

    … system solution to data. To accomplish this, a methodology is developed which utilizes a quasi-Newton method to minimize a least squares residual. In addition, an experimental effort has resulted in over 130 data points taken in a range of pH between 2.8 and 9.0, and at temperatures 25, 50, and …

    ut-knoxville Repository record for Kinetic modeling and parameter optimization of iodine hydrolysis reactions (opens in a new tab)

  18. A General Convergence Theory for Quasi-Newton Methods for Constrained Optimization

    In this thesis we study the local convergence of quasi-Newton methods for nonlinear optimization problems with nonlinear equality constraints. A general theory for analyzing the local convergence of the sequence {x(,k)} generated by the diagonalized quasi-Newton method is developed. Conditions on …

    rice Repository record for A General Convergence Theory for Quasi-Newton Methods for Constrained Optimization (opens in a new tab)

  19. Statistical computing support for Lp estimation in augmented linear models under linear inequality restrictions

    … (p (GREATERTHEQ) 1) estimation in linear models. Methods for computing l(,p) estimate in linear models are studied. In case of p = 1, descent methods from Bloomfield and Steiger, and Usow are discussed. A proof of convergence of these methods is provided. In case of p > 1, Newton's method and …

    iastate Repository record for Statistical computing support for Lp estimation in augmented linear models under linear inequality restrictions (opens in a new tab)

Page 1 of 3