Dimensionality reduction techniques for global optimization
<p>Though ubiquitous in applications, global optimisation problems are generally the most computationally intense due to their solution time growing exponentially with linear increase in their dimensions (this is the well known/so called ‘curse of dimensionality’). In this thesis, we show that...
| Egile nagusia: | |
|---|---|
| Beste egile batzuk: | |
| Formatua: | Thesis |
| Hizkuntza: | English |
| Argitaratua: |
2020
|
| Gaiak: |