Exact Cutting Plane Methods for Quadratic Programming Problems with Applications
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 sp...
| Main Author: | |
|---|---|
| Format: | Thesis |
| Published: |
Curtin University
2024
|
| Online Access: | http://hdl.handle.net/20.500.11937/96234 |
| _version_ | 1848766118280298496 |
|---|---|
| author | Spiers, Sandy |
| author_facet | Spiers, Sandy |
| author_sort | Spiers, Sandy |
| building | Curtin Institutional Repository |
| collection | Online Access |
| description | 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. |
| first_indexed | 2025-11-14T11:46:03Z |
| format | Thesis |
| id | curtin-20.500.11937-96234 |
| institution | Curtin University Malaysia |
| institution_category | Local University |
| last_indexed | 2025-11-14T11:46:03Z |
| publishDate | 2024 |
| publisher | Curtin University |
| recordtype | eprints |
| repository_type | Digital Repository |
| spelling | curtin-20.500.11937-962342024-11-05T01:43:34Z Exact Cutting Plane Methods for Quadratic Programming Problems with Applications Spiers, Sandy 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. 2024 Thesis http://hdl.handle.net/20.500.11937/96234 Curtin University fulltext |
| spellingShingle | Spiers, Sandy Exact Cutting Plane Methods for Quadratic Programming Problems with Applications |
| title | Exact Cutting Plane Methods for Quadratic Programming Problems with Applications |
| title_full | Exact Cutting Plane Methods for Quadratic Programming Problems with Applications |
| title_fullStr | Exact Cutting Plane Methods for Quadratic Programming Problems with Applications |
| title_full_unstemmed | Exact Cutting Plane Methods for Quadratic Programming Problems with Applications |
| title_short | Exact Cutting Plane Methods for Quadratic Programming Problems with Applications |
| title_sort | exact cutting plane methods for quadratic programming problems with applications |
| url | http://hdl.handle.net/20.500.11937/96234 |