Difference between revisions of "ℓ1 Norm Minimization Task"

From GM-RKB
Jump to: navigation, search
m (Text replacement - "]." In:" to "].” In:")
m (Remove links to pages that are actually redirects to this page.)
 
Line 10: Line 10:
 
=== 2013 ===
 
=== 2013 ===
 
* ([[2013_FastMinimizationAlgorithmsforRo|Yang et al., 2013]]) ⇒ [[Allen Y Yang]], [[Zihan Zhou]], [[Arvind Ganesh Balasubramanian]], [[S Shankar Sastry]], and [[Yi Ma]]. ([[2013]]). “[http://arxiv.org/pdf/1007.3753 Fast-minimization Algorithms for Robust Face Recognition].” In: Image Processing, IEEE Transactions on, 22(8).  
 
* ([[2013_FastMinimizationAlgorithmsforRo|Yang et al., 2013]]) ⇒ [[Allen Y Yang]], [[Zihan Zhou]], [[Arvind Ganesh Balasubramanian]], [[S Shankar Sastry]], and [[Yi Ma]]. ([[2013]]). “[http://arxiv.org/pdf/1007.3753 Fast-minimization Algorithms for Robust Face Recognition].” In: Image Processing, IEEE Transactions on, 22(8).  
** QUOTE: [[l1-minimization|<i>l</i>1-minimization]] refers to [[finding the minimum]] [[l1-norm solution]] to an [[underdetermined linear system]] </math>b=Ax</math>. </s> Under certain conditions as described in [[compressive sensing theory]], the [[minimum solution|minimum]] [[l1-norm solution]] is also the [[sparsest solution]]. </s>
+
** QUOTE: [[ℓ1 Norm Minimization Task|<i>l</i>1-minimization]] refers to [[finding the minimum]] [[l1-norm solution]] to an [[underdetermined linear system]] </math>b=Ax</math>. </s> Under certain conditions as described in [[compressive sensing theory]], the [[minimum solution|minimum]] [[l1-norm solution]] is also the [[sparsest solution]]. </s>
  
 
----
 
----
 
__NOTOC__
 
__NOTOC__
 
[[Category:Concept]]
 
[[Category:Concept]]

Latest revision as of 20:45, 23 December 2019

An ℓ1 Norm Minimization Task is a minimization task that is required to find an l1-norm solution to an underdetermined linear system </math>b=Ax</math>.



References

2013