|
**Forschungsprojekte für Studierende (Bachelor/Master, Arbeiten und Praktika)**
|
|
**Forschungsprojekte für Studierende (Bachelor/Master, Arbeiten und Praktika)**
|
|
|
|
|
|
Die folgende Liste von Projekten soll den Sctudenten*innen eine Vorstellung von möglichen Themen für Abschlussarbeiten geben. Sie erhebt keinen Anspruch auf Vollständigkeit und die Studenten*innen sind aufgefordert, ihren eigenen Interessen nachzugehen.
|
|
Die folgende Liste von Projekten soll den Sctudenten_innen eine Vorstellung von möglichen Themen für Abschlussarbeiten geben. Sie erhebt keinen Anspruch auf Vollständigkeit und die Studenten_innen sind aufgefordert, ihren eigenen Interessen nachzugehen.
|
|
|
|
|
|
The folloowing list of projects is intended to give you an idea of the kinds of topics past students have explored for Bachelors and Masters theses. This list is not complete, and students are encouraged to pursue their own interests.
|
|
The folloowing list of projects is intended to give you an idea of the kinds of topics past students have explored for Bachelors and Masters theses. This list is not complete, and students are encouraged to pursue their own interests.
|
|
|
|
|
|
---
|
|
---
|
|
|
|
|
|
**Praktika/Practicals**
|
|
**Praktika/Practicals** _Many of the following Practicals have evolved into theses_
|
|
_Many of the following Practicals have evolved into theses_
|
|
|
|
|
|
|
|
* Integration of concrete experiments into the [ProxToolbox](https://gitlab.gwdg.de/nam/ProxPython)
|
|
|
|
* Integration of CT experiments into the [ProxToolbox](https://gitlab.gwdg.de/nam/ProxPython)
|
|
|
|
* Block/mini-batch methods for CT in the [ProxToolbox](https://gitlab.gwdg.de/nam/ProxPython)
|
|
|
|
* Randomized algorithms in the [ProxToolbox](https://gitlab.gwdg.de/nam/ProxPython)
|
|
|
|
* Integrate programming problems from VA cycle into the [ProxToolbox](https://gitlab.gwdg.de/nam/ProxPython)
|
|
|
|
* Visualisierung von Markov Ketten/Visualizing random function iterations
|
|
|
|
* [SAMSARA](https://pypi.org/project/samsara/): a Reverse Communication quasi-Newton Library
|
|
|
|
|
|
|
|
|
|
```
|
|
|
|
* Integration of concrete experiments into the [ProxToolbox]
|
|
|
|
* Integration of CT experiments into the [ProxToolbox](https://gitlab.gwdg.de/nam/ProxPython)
|
|
|
|
* Block/mini-batch methods for CT in the [ProxToolbox](https://gitlab.gwdg.de/nam/ProxPython)
|
|
|
|
* Randomized algorithms in the [ProxToolbox](https://gitlab.gwdg.de/nam/ProxPython)
|
|
|
|
* Integrate programming problems from VA cycle into the [ProxToolbox](https://gitlab.gwdg.de/nam/ProxPython)
|
|
|
|
* Visualisierung von Markov Ketten/Visualizing random function iterations
|
|
|
|
* [SAMSARA](https://pypi.org/project/samsara/): a Reverse Communication quasi-Newton Library
|
|
|
|
```
|
|
|
|
|
|
---
|
|
---
|
|
|
|
|
|
|
|
|
|
**Bachelor- und Masterarbeiten**
|
|
**Bachelor- und Masterarbeiten**
|
|
|
|
|
|
* Untersuchung und Analyse von Algorithmen zur matrix completion/survey
|
|
```
|
|
and analysis of algorithms for matrix completion
|
|
* Untersuchung und Analyse von Algorithmen zur matrix completion/survey
|
|
* Projektionsverfahren für machinelles Lernen/projection methods for machine learning
|
|
and analysis of algorithms for matrix completion
|
|
* Online optimization/adversarial network a la Myiam Fazel
|
|
* Projektionsverfahren für machinelles Lernen/projection methods for machine learning
|
|
* Stochastische optimierungsverfahren für Öffentlicher Verkehr auf Abruf/
|
|
* Online optimization/adversarial network a la Myiam Fazel
|
|
stochastic optimization methods for public transportation on demand
|
|
* Stochastische optimierungsverfahren für Öffentlicher Verkehr auf Abruf/
|
|
* Markov Chain Monte Carlo Methoden für Betriebsplannung/MCMC methods for
|
|
stochastic optimization methods for public transportation on demand
|
|
production planning
|
|
* Markov Chain Monte Carlo Methoden für Betriebsplannung/MCMC methods for
|
|
* Risk optimization
|
|
production planning
|
|
* Variational methods for image processing
|
|
* Risk optimization
|
|
* Quantum computing algorithms
|
|
* Variational methods for image processing
|
|
* Stochastic tomography (Praktikum/Arbeit)
|
|
* Quantum computing algorithms
|
|
* Topics in Variational Analysis:
|
|
* Stochastic tomography (Praktikum/Arbeit)
|
|
- metric subregularity of concrete algorithms in explicit settings
|
|
* Topics in Variational Analysis:
|
|
- almost alpha-firm nonexpansiveness of concrete algorithms in explicit settings
|
|
- metric subregularity of concrete algorithms in explicit settings
|
|
- duality for difference of convex functions paradigm
|
|
- almost alpha-firm nonexpansiveness of concrete algorithms in explicit settings
|
|
- nonconvex duality theory (nonconvex Douglas-Rachford/ADMM for DC programming)
|
|
- duality for difference of convex functions paradigm
|
|
- acceleration methods in nonlinear programming
|
|
- nonconvex duality theory (nonconvex Douglas-Rachford/ADMM for DC programming)
|
|
- local analysis of acceleration methods
|
|
- acceleration methods in nonlinear programming
|
|
- survey and analysis of methods for computing convex hulls
|
|
- local analysis of acceleration methods
|
|
- Kurdyka-Lloyosievich implies gauge metric subregularity
|
|
- survey and analysis of methods for computing convex hulls
|
|
- constructing p-cyclically monotone mappings
|
|
- Kurdyka-Lloyosievich implies gauge metric subregularity
|
|
- characterize functions whose subdifferentials are TYPE-I monotone
|
|
- constructing p-cyclically monotone mappings
|
|
- when does T almost nonexpansive have full domain?
|
|
- characterize functions whose subdifferentials are TYPE-I monotone
|
|
- When can an almost nonexpansive mapping be extended one with full domain?
|
|
- when does T almost nonexpansive have full domain?
|
|
|
|
- When can an almost nonexpansive mapping be extended one with full domain?
|
|
|
|
```
|
|
|
|
|
|
---
|
|
---
|
|
|
|
|
|
|
|
|
|
Bei Interesse wenden Sie sich bitte an [Prof. Russell Luke](https://vaopt.math.uni-goettingen.de/en/contact.php) |
|
Bei Interesse wenden Sie sich bitte an [Prof. Russell Luke](https://vaopt.math.uni-goettingen.de/en/contact.php) |
|
\ No newline at end of file |
|
|