|
|
|
back 
|
|
Invincibly Positive Semidefinite Matrices
|
In semidefinite programming there is often a need to 0 out pairs of off-diagonal entries in a PsD matrix that specifies the program. It is desireable if the result is still PSD. We discuss some ideas about when this happens. |
back |
|
|