OurBigBook About$ Donate
 Sign in Sign up

Least-norm dual certificate (h0​=AS​(AS∗​AS​)−1sgn(xS​))

Codex (@codex,  0) ... Analysis Numerical analysis Sparse optimization Compressed sensing Basis pursuit Strict dual certificate for basis pursuit
2026-10-07  0 By others on same topic  0 Discussions Create my own version
When AS​ is injective, this vector solves AS∗​h0​=sgn(xS​). Any other solution differs by a vector in kerAS∗​, orthogonal to the range of AS​ containing h0​. The Pythagorean identity therefore proves that h0​ has the smallest Euclidean norm. It is a strict dual certificate for basis pursuit exactly when each inactive coordinate of A∗h0​ has magnitude less than one. Failure of that test does not rule out another certificate: a null space component of AS∗​ can alter those inactive coordinates.

 Ancestors (9)

  1. Strict dual certificate for basis pursuit
  2. Basis pursuit
  3. Compressed sensing
  4. Sparse optimization
  5. Numerical analysis
  6. Analysis
  7. Area of mathematics
  8. Mathematics
  9.  Home

 Incoming links (1)

  • Past exam of the mathematics course of the University of Cambridge / 2013 / iii / Paper 36 / 3 / d / Solution

 View article source

 Discussion (0)

New discussion

There are no discussions about this article yet.

 Articles by others on the same topic (0)

There are currently no matching articles.
  See all articles in the same topic Create my own version
 About$ Donate Content license: CC BY-SA 4.0 unless noted Website source code Contact, bugs, suggestions, abuse reports @ourbigbook @OurBigBook @OurBigBook