93 citations · 217 across the 21 of their papers we have counts for
4 papers · 1 filter
High-order methods beyond the classical complexity bounds, II: inexact high-order proximal-point methods with segment search
Masoud Ahookhosh, Yurii Nesterov
A bi-level optimization framework (BiOPT) was proposed in [3] for convex composite optimization, which is a generalization of bi-level unconstrained minimization framework (BLUM) g…
High-order methods beyond the classical complexity bounds, I: inexact high-order proximal-point methods
Masoud Ahookhosh, Yurii Nesterov
In this paper, we introduce a \textit{Bi-level OPTimization} (BiOPT) framework for minimizing the sum of two convex functions, where both can be nonsmooth. The BiOPT framework invo…
Block Alternating Bregman Majorization Minimization with Extrapolation
Le Thi Khanh Hien, Duy Nhat Phan, Nicolas Gillis +2
In this paper, we consider a class of nonsmooth nonconvex optimization problems whose objective is the sum of a block relative smooth function and a proper and lower semicontinuous…
Bregman Finito/MISO for nonconvex regularized finite sum minimization without Lipschitz gradient continuity
Puya Latafat, Andreas Themelis, Masoud Ahookhosh +1
We introduce two algorithms for nonconvex regularized finite sum minimization, where typical Lipschitz differentiability assumptions are relaxed to the notion of relative smoothnes…