MM algorithm

Known as: MM 
The MM algorithm is an iterative optimization method which exploits the convexity of a function in order to find their maxima or minima. The MM… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2015
2015
Variance components estimation and mixed model analysis are central themes in statistics with applications in numerous scientific… (More)
  • figure 1
  • table 1
  • table 2
  • table 3
  • table 4
Is this relevant?
Review
2014
Review
2014
Deconvolution refers to the problem of estimating the unknown input to an LTI system when the output signal and system response… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2014
2014
Total variation denoising (TVD) is an approach for noise reduction developed so as to preserve sharp edges in the underlying… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2014
2014
This paper derives new algorithms for signomial programming, a generalization of geometric programming. The algorithms are based… (More)
  • table 1
  • figure 1
  • table 2
  • table 3
Is this relevant?
Highly Cited
2011
Highly Cited
2011
This letter describes algorithms for nonnegative matrix factorization (NMF) with the β-divergence (β-NMF). The β-divergence is a… (More)
  • figure 1
  • table 1
  • figure 2
  • table 2
  • table 3
Is this relevant?
Highly Cited
2010
Highly Cited
2010
This paper describes algorithms for nonnegative matrix factorization (NMF) with the β-divergence (β-NMF). The β-divergence is a… (More)
  • table 1
  • figure 1
  • figure 2
  • table 2
  • table 3
Is this relevant?
Highly Cited
2007
Highly Cited
2007
The majorize-minimize (MM) optimization technique has received considerable attention in signal and image processing applications… (More)
  • figure 1
Is this relevant?
Highly Cited
2006
Highly Cited
2006
Recent research on map matching algorithms for land vehicle navigation has been based on either a conventional topological… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2005
2005
It is well known that the likelihood sequence of the EM algorithm is nondecreasing and convergent (Dempster, Laird and Rubin… (More)
  • figure 1
Is this relevant?
Highly Cited
2003
Highly Cited
2003
This paper presents a scalable architecture for the computation of modular multiplication, based on the Montgomery multiplication… (More)
  • figure 2
  • figure 1
  • figure 3
  • figure 4
  • figure 5
Is this relevant?