Homepage › Solution manuals › Gilbert Strang › Linear Algebra and Learning from Data › Exercise 3.5.2
Exercise 3.5.2
Answers
From the equation we have
To find the matrix with smallest “sum norm” , since and are kind of independent of each other in terms of constraints. So we can find the minimum of and separately.
First notice, that since , according to the figure I.16, this line will always cross the diamond generated by regardless of the value of . so the minimum value of is 0 when .
For , this line has intercepts with -axis at , and intercept with -axis at . Imagine the diamond generated by gradually expands as increases from 0. It will first touch the intercept with -axis at , so the minimum of when .