Please use this identifier to cite or link to this item: http://hdl.handle.net/2381/34777
Title: Optimization techniques and their application.
Authors: Henderson, J. T.
Award date: 1978
Presented at: University of Leicester
Abstract: The problem of optimizing a nonlinear function of one or more variables in the sense of locating the values of the variables which give the greatest or least value of the function, is considered from two points of view. First, the development of two new and improved techniques for optimization is described. Second, the ways in which the available techniques can be applied are discussed with reference to case studies of practical significance. The two new techniques are for unconstrained optimization problems of a type which frequently occur in curve-fitting and modelling applications and also in the solution of sets of nonlinear equations. The first of these is a new two-part algorithm for minimizing a sum of squares objective function; it uses a new descent method in combination with a modified Gauss-Newton search to give an algorithm which has proved extremely reliable even when applied to difficult problems. The second technique is a hybrid algorithm for minimizing a sum of moduli objective function; it makes novel use of the methods of parametric linear programming. Ten case studies of the application of optimization techniques are described, ranging from problems involving a single variable up to a problem with several hundred variables. The areas from which the applications are drawn include biochemistry, engineering, statistics and theoretical physics; the problems themselves are mainly concerned with curve-fitting or the solution of nonlinear equations.
Links: http://hdl.handle.net/2381/34777
Type: Thesis
Level: Doctoral
Qualification: Ph.D.
Rights: Copyright © the author. All rights reserved.
Appears in Collections:Leicester Theses
Theses, Dept. of Engineering

Files in This Item:
File Description SizeFormat 
U435546.pdf8.75 MBAdobe PDFView/Open


Items in LRA are protected by copyright, with all rights reserved, unless otherwise indicated.