|
|
**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.
|
|
|
|
... | ... | @@ -6,49 +6,42 @@ The following list of projects is intended to give you an idea of the kinds of t |
|
|
|
|
|
---
|
|
|
|
|
|
**Praktika/Practicals** _Many of the following Practicals have evolved into theses_
|
|
|
## **Praktika/Practicals** _Many of the following Practicals have evolved into theses_
|
|
|
|
|
|
```
|
|
|
* Integration of concrete experiments into the ProxToolbox
|
|
|
* 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
|
|
|
```
|
|
|
* 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 and analysis of algorithms for matrix completion
|
|
|
* Projektionsverfahren für machinelles Lernen/projection methods for machine learning
|
|
|
* Online optimization/adversarial network a la Myiam Fazel
|
|
|
* Stochastische optimierungsverfahren für Öffentlicher Verkehr auf Abruf/
|
|
|
stochastic optimization methods for public transportation on demand
|
|
|
* Markov Chain Monte Carlo Methoden für Betriebsplannung/MCMC methods for
|
|
|
production planning
|
|
|
* Stochastische optimierungsverfahren für Öffentlicher Verkehr auf Abruf/ stochastic optimization methods for public transportation on demand
|
|
|
* Markov Chain Monte Carlo Methoden für Betriebsplannung/MCMC methods for production planning
|
|
|
* Risk optimization
|
|
|
* Variational methods for image processing
|
|
|
* Quantum computing algorithms
|
|
|
* Stochastic tomography (Praktikum/Arbeit)
|
|
|
* Topics in Variational Analysis:
|
|
|
- metric subregularity of concrete algorithms in explicit settings
|
|
|
- almost alpha-firm nonexpansiveness of concrete algorithms in explicit settings
|
|
|
- duality for difference of convex functions paradigm
|
|
|
- nonconvex duality theory (nonconvex Douglas-Rachford/ADMM for DC programming)
|
|
|
- acceleration methods in nonlinear programming
|
|
|
- local analysis of acceleration methods
|
|
|
- survey and analysis of methods for computing convex hulls
|
|
|
- Kurdyka-Lloyosievich implies gauge metric subregularity
|
|
|
- constructing p-cyclically monotone mappings
|
|
|
- characterize functions whose subdifferentials are TYPE-I monotone
|
|
|
- when does T almost nonexpansive have full domain?
|
|
|
- When can an almost nonexpansive mapping be extended one with full domain?
|
|
|
```
|
|
|
- metric subregularity of concrete algorithms in explicit settings
|
|
|
- almost alpha-firm nonexpansiveness of concrete algorithms in explicit settings
|
|
|
- duality for difference of convex functions paradigm
|
|
|
- nonconvex duality theory (nonconvex Douglas-Rachford/ADMM for DC programming)
|
|
|
- acceleration methods in nonlinear programming
|
|
|
- local analysis of acceleration methods
|
|
|
- survey and analysis of methods for computing convex hulls
|
|
|
- Kurdyka-Lloyosievich implies gauge metric subregularity
|
|
|
- constructing p-cyclically monotone mappings
|
|
|
- characterize functions whose subdifferentials are TYPE-I monotone
|
|
|
- when does T almost nonexpansive have full domain?
|
|
|
- When can an almost nonexpansive mapping be extended one with full domain?
|
|
|
|
|
|
---
|
|
|
|
... | ... | |