String-averaging incremental subgradient methods for constrained convex optimization problems
In this doctoral thesis, we propose new iterative methods for solving a class of convex optimization problems. In general, we consider problems in which the objective function is composed of a finite sum of convex functions and the set of constraints is, at least, convex and closed. The iterative me...
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en |
| Published: |
Biblioteca Digitais de Teses e Dissertações da USP
2017
|
| Subjects: | |
| Online Access: | http://www.teses.usp.br/teses/disponiveis/55/55134/tde-14112017-150512/ |