Please use this identifier to cite or link to this item:
|Type:||Artigo de periódico|
|Title:||INCREMENTAL SUBGRADIENTS FOR CONSTRAINED CONVEX OPTIMIZATION: A UNIFIED FRAMEWORK AND NEW METHODS|
De Pierro, AR
|Abstract:||We present a unifying framework for nonsmooth convex minimization bringing together is an element of-subgradient algorithms and methods for the convex feasibility problem. This development is a natural step for is an element of-subgradient methods in the direction of constrained optimization since the Euclidean projection frequently required in such methods is replaced by an approximate projection, which is often easier to compute. The developments are applied to incremental subgradient methods, resulting in new algorithms suitable to large-scale optimization problems, such as those arising in tomographic imaging.|
|Appears in Collections:||Unicamp - Artigos e Outros Documentos|
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.