- AutorIn
- Dipl.-Math. oec. Christopher Hendrich
- Titel
- Proximal Splitting Methods in Nonsmooth Convex Optimization
- Zitierfähige Url:
- https://nbn-resolving.org/urn:nbn:de:bsz:ch1-qucosa-149548
- Datum der Einreichung
- 28.04.2014
- Datum der Verteidigung
- 17.07.2014
- Abstract (EN)
- This thesis is concerned with the development of novel numerical methods for solving nondifferentiable convex optimization problems in real Hilbert spaces and with the investigation of their asymptotic behavior. To this end, we are also making use of monotone operator theory as some of the provided algorithms are originally designed to solve monotone inclusion problems. After introducing basic notations and preliminary results in convex analysis, we derive two numerical methods based on different smoothing strategies for solving nondifferentiable convex optimization problems. The first approach, known as the double smoothing technique, solves the optimization problem with some given a priori accuracy by applying two regularizations to its conjugate dual problem. A special fast gradient method then solves the regularized dual problem such that an approximate primal solution can be reconstructed from it. The second approach affects the primal optimization problem directly by applying a single regularization to it and is capable of using variable smoothing parameters which lead to a more accurate approximation of the original problem as the iteration counter increases. We then derive and investigate different primal-dual methods in real Hilbert spaces. In general, one considerable advantage of primal-dual algorithms is that they are providing a complete splitting philosophy in that the resolvents, which arise in the iterative process, are only taken separately from each maximally monotone operator occurring in the problem description. We firstly analyze the forward-backward-forward algorithm of Combettes and Pesquet in terms of its convergence rate for the objective of a nondifferentiable convex optimization problem. Additionally, we propose accelerations of this method under the additional assumption that certain monotone operators occurring in the problem formulation are strongly monotone. Subsequently, we derive two Douglas–Rachford type primal-dual methods for solving monotone inclusion problems involving finite sums of linearly composed parallel sum type monotone operators. To prove their asymptotic convergence, we use a common product Hilbert space strategy by reformulating the corresponding inclusion problem reasonably such that the Douglas–Rachford algorithm can be applied to it. Finally, we propose two primal-dual algorithms relying on forward-backward and forward-backward-forward approaches for solving monotone inclusion problems involving parallel sums of linearly composed monotone operators. The last part of this thesis deals with different numerical experiments where we intend to compare our methods against algorithms from the literature. The problems which arise in this part are manifold and they reflect the importance of this field of research as convex optimization problems appear in lots of applications of interest.
- Freie Schlagwörter (DE)
- primal-duale Algorithmen, Glättungstechnik, monotone Inklusionen, konjugierte Dualität, konvexe Optimierung, nichtglatte Optimierung, Proximalpunktabbildung, Resolvente, Projektion, Bildbearbeitung, Standortprobleme, maschinelles Lernen, Portfoliooptimierung, Clusteraufgaben
- Freie Schlagwörter (EN)
- primal-dual algorithm, smoothing technique, monotone inclusions, conjugate duality, convex optimization, nonsmooth opimization, proximal point mapping, resolvent, projection, imaging, location problems, machine learning, portfolio optimization, clustering
- Klassifikation (DDC)
- 510
- Normschlagwörter (GND)
- Konvexe Optimierung, Dualität, Verfahren, Konvergenz, Monotoner Operator, Anwendung
- GutachterIn
- Prof. Dr. Radu Ioan Boţ
- Prof. Dr. Gabriele Steidl
- Prof. Dr. Heinz H. Bauschke

- BetreuerIn
- Prof. Dr. Radu Ioan Boţ

- Den akademischen Grad verleihende / prüfende Institution
- Technische Universität Chemnitz, Chemnitz
- URN Qucosa
- urn:nbn:de:bsz:ch1-qucosa-149548
- Veröffentlichungsdatum Qucosa
- 25.07.2014
- Dokumenttyp
- Dissertation
- Sprache des Dokumentes
- Englisch