A Proximal Bundle Variant with Optimal Iteration-Complexity

16h00 - 18h00

About Event

Quem: Jiaming Liang

Onde: Via Zoom

Quando: 09 de Dezembro de 2021, às 16h

In convex nonsmooth optimization, it is known that the proximal bundle (PB) method has better practical performance than the subgradient method, since the whole historical information has been compressed to the current model. On the other hand, the subgradient method is known to possess the optimal iteration-complexity bound, however, the complexity estimate for the standard PB method is non-optimal. In this talk, we present a novel PB variant, namely, the relaxed proximal bundle (RPB) method, for solving convex nonsmooth composite optimization problems. Optimal iteration-complexity bounds for RPB are established for a large range of prox stepsizes, both in the convex and strongly convex settings.

*Texto informado pelo autor

Registre-se com antecedência para este seminário

Após o registro, você receberá um e-mail de confirmação contendo informações sobre conexão no seminário.


Jiaming Liang - is a Ph.D. student in Operations Research at Georgia Institute of Technology, under the supervision of Renato Monteiro. His research interests broadly include topics in optimization and algorithms, such as convex and nonconvex optimization, nonsmooth optimization, and high-dimensional sampling algorithms.