Exact Cutting Plane Methods for Quadratic Programming Problems with Applications
| dc.contributor.author | Spiers, Sandy | |
| dc.contributor.supervisor | Hoa Bui | en_US |
| dc.contributor.supervisor | Ryan Loxton | en_US |
| dc.date.accessioned | 2024-10-30T05:06:38Z | |
| dc.date.available | 2024-10-30T05:06:38Z | |
| dc.date.issued | 2024 | en_US |
| dc.identifier.uri | http://hdl.handle.net/20.500.11937/96234 | |
| dc.description.abstract |
This thesis bridges the methodological divide between concave and nonconcave optimisation by adapting cutting plane techniques to nonconcave mixed-integer quadratic programming problems. We introduce the novel concept of directional concavity, asserting the concavity of a quadratic function along specific directions, which enables the use of linear approximations for global optimization. This approach results in efficient exact methods for solving general quadratic programming problems. | en_US |
| dc.publisher | Curtin University | en_US |
| dc.title | Exact Cutting Plane Methods for Quadratic Programming Problems with Applications | en_US |
| dc.type | Thesis | en_US |
| dcterms.educationLevel | PhD | en_US |
| curtin.department | School of Electrical Engineering, Computing and Mathematical Sciences | en_US |
| curtin.accessStatus | Open access | en_US |
| curtin.faculty | Science and Engineering | en_US |
| curtin.contributor.orcid | Spiers, Sandy [0000-0002-0961-0425] | en_US |