Quantitative Analysis of Iterative Algorithms in Fixed Point Theory and Convex Optimization
The ongoing program of `proof mining' aims to extract new, quantitative information in the form of bounds and rates from prima facie noneffective proofs in mathematics. In doing so, proof mining and the thesis at hand draws a bridge between mathematics and logic, prompting a lively interaction...
| Main Author: | |
|---|---|
| Format: | Others |
| Language: | German en |
| Published: |
2016
|
| Online Access: | https://tuprints.ulb.tu-darmstadt.de/5485/1/diss.pdf Körnlein, Daniel <http://tuprints.ulb.tu-darmstadt.de/view/person/K=F6rnlein=3ADaniel=3A=3A.html> (2016): Quantitative Analysis of Iterative Algorithms in Fixed Point Theory and Convex Optimization.Darmstadt, Technische Universität Darmstadt, [Ph.D. Thesis] |
Internet
https://tuprints.ulb.tu-darmstadt.de/5485/1/diss.pdfKörnlein, Daniel <http://tuprints.ulb.tu-darmstadt.de/view/person/K=F6rnlein=3ADaniel=3A=3A.html> (2016): Quantitative Analysis of Iterative Algorithms in Fixed Point Theory and Convex Optimization.Darmstadt, Technische Universität Darmstadt, [Ph.D. Thesis]