Raghavendra Upadhya

New proof confirms condition-number barrier in sparse least squares

Researchers have established a lower bound for sparse least squares optimization, confirming a conjecture that polynomial-time algorithms cannot improve upon the dependency on the restricted condition number. This findi…