Skip navigation
Skip navigation

Sequential algorithms in nonlinear programming

Jittorntrum, Krisorn


In this thesis, a class of methods for solving the following non-linear programming problem: minimize f(x) subject to x e S = {hi(x)=O,i=l,...ℓ;gj(x) ≥o, j=l,...,m} is investigated. The class of methods under investigation consists of the ones which reduce the computational process to a sequence of unconstrained minimization subproblems. These methods arc generally noted for their simplicity and robustness. The aim is to analyse and extend existing results on the structure and convergence...[Show more]

CollectionsOpen Access Theses
Date published: 1978-07
Type: Thesis (PhD)


File Description SizeFormat Image
Jittortrum_K_1978.pdf14 MBAdobe PDFThumbnail

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

Updated:  20 July 2017/ Responsible Officer:  University Librarian/ Page Contact:  Library Systems & Web Coordinator