Theorem 3.1, (15) — the RLS problem is the SOCP minimize λ s.t. ‖Ax − b‖ ≤ λ − τ, ‖[x; 1]‖ ≤ τ

Initializing...

Theorem 3.1, (15) — the RLS problem is the SOCP minimize λ s.t. ‖Ax − b‖ ≤ λ − τ, ‖[x; 1]‖ ≤ τ · Prove2Me