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 4 of 4 for “"Conjugate direction methods"”.
-
A Comparisation of Methods for the Optimisation of a Non-Linear Function Subject to Non-Linear Constraints
… compared: A direct search method (Simplex); Two conjugate direction methods: (a) Powell (64)'s method not requiring the calculation of derivatives; (b) Fletcher and Powell’s method requiring the calculation of derivatives. All the methods have been written in the same language, ICL Algol 60, and …
-
Function minimizing algorithms
Thesis (Ph. D.)--Michigan State University, Department of Mathematics, 1970
-
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 …
-
Multiplicity of positive solutions of even-order nonhomogeneous boundary value problems.
In this work, we discuss multiplicity results for nonhomogeneous even-order boundary value problems on both discrete and continuous domains. We develop a method for establishing existence of positive solutions by transforming even-order problems into a series of second order problems satisfying …