3 citations · 5 across the 8 of their papers we have counts for
9 papers
Dynamic inverse problems: Single-loop online algorithms
Jyrki Jauhiainen, Yassine Nabou, Tuomo Valkonen
We study efficient online methods for dynamic inverse problems with infinite time horizon. We concentrate, in particular, on problems whose forward model arises from a PDE. Our mot…
Dynamic inverse problems: Online regularisation theory
Jyrki Jauhiainen, Yassine Nabou, Tuomo Valkonen
We develop regularisation theory for dynamic inverse problems, solved using online methods with an infinite time horizon. Using concepts of subregularity to treat nonsmooth regular…
Monotone and nonmonotone linearized block coordinate descent methods for nonsmooth composite optimization problems
Yassine Nabou, Lahcen El Bourkhissi, Sebastian U. Stich +1
In this paper, we introduce both monotone and nonmonotone variants of LiBCoD, a \textbf{Li}nearized \textbf{B}lock \textbf{Co}ordinate \textbf{D}escent method for solving composite…
Modified projected Gauss-Newton method for constrained nonlinear least-squares: application to power flow analysis
Yassine Nabou, Lucian Toma, Ion Necoara
In this paper, we consider a modified projected Gauss-Newton method for solving constrained nonlinear least-squares problems. We assume that the functional constraints are smooth a…
Regularized higher-order Taylor approximation methods for nonlinear least-squares
Yassine Nabou, Ion Necoara
In this paper, we develop a regularized higher-order Taylor based method for solving composite (e.g., nonlinear least-squares) problems. At each iteration, we replace each smooth c…
Nonmonotone higher-order Taylor approximation methods for composite problems
Yassine Nabou
We study composite optimization problems in which the smooth part of the objective function is \( p \)-times continuously differentiable, where \( p \geq 1 \) is an integer. Higher…
Moving higher-order Taylor approximations method for smooth constrained minimization problems
Yassine Nabou, Ion Necoara
In this paper we develop a higher-order method for solving composite (non)convex minimization problems with smooth (non)convex functional constraints. At each iteration our method…
Proximal gradient methods with inexact oracle of degree q for composite optimization
Yassine Nabou, Francois Glineur, Ion Necoara
We introduce the concept of inexact first-order oracle of degree q for a possibly nonconvex and nonsmooth function, which naturally appears in the context of approximate gradient,…
Efficiency of higher-order algorithms for minimizing composite functions
Yassine Nabou, Ion Necoara
Composite minimization involves a collection of functions which are aggregated in a nonsmooth manner. It covers, as a particular case, smooth approximation of minimax games, minimi…