Convergence Analysis of Block Majorize-Minimize Subspace Approach - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Optimization Letters Year : 2023

Convergence Analysis of Block Majorize-Minimize Subspace Approach

Emilie Chouzenoux
Jean-Baptiste Fest
  • Function : Author
  • PersonId : 1211087


We consider the minimization of a differentiable Lipschitz gradient but non necessarily convex, function F defined on R N. We propose an accelerated gradient descent approach which combines three strategies, namely (i) a variable metric derived from the majorization-minimization principle ; (ii) a subspace strategy incorporating information from the past iterates ; (iii) a block alternating update. Under the assumption that F satisfies the Kurdyka-Łojasiewicz property, we give conditions under which the sequence generated by the resulting block majorize-minimize subspace algorithm converges to a critical point of the objective function, and we exhibit convergence rates for its iterates.
Fichier principal
Vignette du fichier
Opt_Letter_Springer_Accepted.pdf (673.37 Ko) Télécharger le fichier
Origin Files produced by the author(s)

Dates and versions

hal-04202728 , version 1 (11-09-2023)




Emilie Chouzenoux, Jean-Baptiste Fest. Convergence Analysis of Block Majorize-Minimize Subspace Approach. Optimization Letters, In press, ⟨10.1007/s11590-023-02055-z⟩. ⟨hal-04202728⟩
25 View
26 Download



Gmail Mastodon Facebook X LinkedIn More