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 iterativ...

Full description

Bibliographic Details
Main Author: Rafael Massambone de Oliveira
Other Authors: Elias Salomão Helou Neto
Language:English
Published: Universidade de São Paulo 2017
Subjects:
Online Access:http://www.teses.usp.br/teses/disponiveis/55/55134/tde-14112017-150512/