|
|
**Forschungsprojekte für Studierende (Bachelor/Master, Arbeiten und Praktika)**
|
|
|
|
|
|
Die folgende Liste von Projekten soll den Schülern eine Vorstellung von möglichen Themen für Abschlussarbeiten geben. Sie erhebt keinen Anspruch auf Vollständigkeit und die Schüler/innen sind aufgefordert, ihren eigenen Interessen nachzugehen.
|
|
|
|
|
|
**Prof. Russell Luke:**
|
|
|
|
|
|
* 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
|
|
|
* Risk optimization
|
|
|
* Variational methods for image processing
|
|
|
* Visualisierung von Markov Ketten/Visualizing random function iterations
|
|
|
* Quantum computing algorithms
|
|
|
* Stochastic tomography (Praktikum/Arbeit)
|
|
|
* Integration of concrete experiments into the ProxToolbox (Praktikum/Arbeit)
|
|
|
* Integration of CT experiments into the ProxToolbox
|
|
|
* Block/mini-batch methods for CT in the ProxToolbox (Praktikum)
|
|
|
* Randomized algorithms in the ProxToolbox (Praktikum)
|
|
|
* Integrate programming problems from VA cycle into the ProxToolbox (Praktikum)
|
|
|
* 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 CD programming)
|
|
|
- acceleration methods in nonlinear programming
|
|
|
- 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? |
|
|
\ No newline at end of file |