- Title
- Algorithms for the solution of the quadratic programming problem
- Creator
- Vankova, Martina
- Subject
- Quadratic programming
- Subject
- Nonlinear programming
- Subject
- Algorithms
- Date Issued
- 2004
- Date
- 2004
- Type
- Thesis
- Type
- Masters
- Type
- MSc
- Identifier
- vital:11086
- Identifier
- http://hdl.handle.net/10948/348
- Identifier
- Quadratic programming
- Identifier
- Nonlinear programming
- Identifier
- Algorithms
- Description
- The purpose of this dissertation was to provide a review of the theory of Optimization, in particular quadratic programming, and the algorithms suitable for solving both convex and non-convex quadratic programming problems. Optimization problems arise in a wide variety of fields and many can be effectively modeled with linear equations. However, there are problems for which linear models are not sufficient thus creating a need for non-linear systems. This dissertation includes a literature study of the formal theory necessary for understanding optimization and an investigation of the algorithms available for solving a special class of the non-linear programming problem, namely the quadratic programming problem. It was not the intention of this dissertation to discuss all possible algorithms for solving the quadratic programming problem, therefore certain algorithms for convex and non-convex quadratic programming problems were selected for a detailed discussion in the dissertation. Some of the algorithms were selected arbitrarily, because limited information was available comparing the efficiency of the various algorithms. Algorithms available for solving general non-linear programming problems were also included and briefly discussed as they can be used to solve quadratic programming problems. A number of algorithms were then selected for evaluation, depending on the frequency of use in practice and the availability of software implementing these algorithms. The evaluation included a theoretical and quantitative comparison of the algorithms. The quantitative results were analyzed and discussed and it was shown that the results supported the theoretical comparison. It was also shown that it is difficult to conclude that one algorithm is better than another as the efficiency of an algorithm greatly depends on the size of the problem, the complexity of an algorithm and many other implementation issues. Optimization problems arise continuously in a wide range of fields and thus create the need for effective methods of solving them. This dissertation provides the fundamental theory necessary for the understanding of optimization problems, with particular reference to quadratic programming problems and the algorithms that solve such problems. Keywords: Quadratic Programming, Quadratic Programming Algorithms, Optimization, Non-linear Programming, Convex, Non-convex.
- Format
- 169 pages
- Format
- Publisher
- University of Port Elizabeth
- Publisher
- Faculty of Science
- Language
- English
- Rights
- Nelson Mandela Metropolitan University
- Hits: 1851
- Visitors: 2143
- Downloads: 364
Collections
UPE Faculty of Science
| Thumbnail | File | Description | Size | Format | |||
|---|---|---|---|---|---|---|---|
| View Details Download | SOURCEPDF | 973 KB | Adobe Acrobat PDF | View Details Download |