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 92 for “"Newton methods"”.
-
Newton Methods for Image Registration
… to medical registration tasks. However, the methods developed are not restricted to the field of medical image processing. We also have a closer look at more general forms of optimization problems and show connections to related tasks.
-
Quasi-Newton Methods for Nonlinear Programming
… 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.
-
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 …
-
Inexact Proximal Newton Methods for Finite Strain Plasticity
… plasticity, the algorithmic idea of Proximal Newton methods for composite minimization problems is introduced as considered in the literature for finite dimensional optimization. Since existing formulations do not allow for the treatment of function space problems like finite strain …
-
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 …
-
A General Convergence Theory for Quasi-Newton Methods for Constrained Optimization
… 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 the …
-
Approximate Newton Methods for Distributed Learning over Communication-Constrained Wireless Networks
… the application of Hessian-based optimization methods. By leveraging second-order information, the learning process can be accelerated, requiring fewer iterations and reduced communication to accomplish learning tasks efficiently. The work addresses key challenges in FL and Fully Distributed …
-
On the use of function values to improve Quasi-Newton methods
… constraints or the problem may be unconstrained. Methods of optimization may be classified as derivative (or gradient) methods and non-derivative methods. We assume that the n-variable function to be optimized and its first partial derivatives are all continuous. In this work, we intend to examine …
-
Mesh independent convergence of modified inexact Newton methods for second order nonlinear problems
… this dissertation, we consider modified inexact Newton methods applied to second order nonlinear problems. In the implementation of Newton's method applied to problems with a large number of degrees of freedom, it is often necessary to solve the linear Jacobian system iteratively. Although a …
-
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, …
-
Nonsmooth Newton Methods for Solving the Best Approximation Problem; with Applications to Linear Programming
… regularization to a nonsmooth Newton method. We expand this application to exact and inexact nonsmooth Newton methods and apply it to the best approximation constrained to a polyhedral set problem. We also demonstrate that linear programs can be represented as a best …
-
On the Use of Quasi-Newton Methods for the Minimization of Convex Quadratic Splines
In reformulating a strictly convex quadratic program with simple bound constraints as the unconstrained minimization of a strictly convex quadratic spline, established algorithms can be implemented with relaxed differentiability conditions. In this work, the positive definite secant update method …
-
Analytical study of multi-secant quasi-Newton methods for optimization problems : approaching the multi-secant property in symmetric quasi-Newton update formulas
Quasi-Newton (QN) methods are widely used both in root-finding of nonlinear numerical problems and in the search for optimal solutions for applications in industry or research and development. Since the algebraic forms of these problems are often not available, the Jacobian matrix is replaced by an …
-
Quasi-Newton and Multigrid Methods for Semiconductor Device Simulation
… analysis of Gummel's method and quasi-Newton methods is extended to a nonuniform mesh and the Bernoulli function discretization. It is proved that Gummel's method and the quasi-Newton methods for the scaled carrier densities and carrier densities converge locally for sufficiently smooth …
-
Matrix Factorizations, Triadic Matrices, and Modified Cholesky Factorizations for Optimization
… of symmetric matrices and their application to Newton-type optimization. A matrix is called triadic if it has at most two nonzero off-diagonal elements in each column. Tridiagonal matrices are a special case of these. We prove that the triadic structure is preserved in the Cholesky-related …
Page 1 of 5