activity
20032026
most citedA framework to characterize performance of LASSO algorithms

99 citations · 428 across the 78 of their papers we have counts for

collaborators
Showing math.OCShow all

12 papers · 1 filter

math.OC2024

Exact objectives of random linear programs and mean widths of random polyhedrons

Mihailo Stojnic

We consider \emph{random linear programs} (rlps) as a subclass of \emph{random optimization problems} (rops) and study their typical behavior. Our particular focus is on appropriat…

math.OC2016

Partial optimization in random linear systems -- finite dimensions

Mihailo Stojnic

In this paper we provide a complementary set of results to those we present in our companion work \cite{Stojnicl1HidParasymldp} regarding the behavior of the so-called partial $\el…

math.OC2016

Partial optimization in random linear systems -- phase transitions and large deviations

Mihailo Stojnic

optimization is a well known heuristic often employed for solving various forms of sparse linear problems. In this paper we look at its a variant that we refer to as the \…

math.OC2016

Box constrained optimization in random linear systems -- finite dimensions

Mihailo Stojnic

Our companion work \cite{Stojnicl1BnBxasymldp} considers random under-determined linear systems with box-constrained sparse solutions and provides an asymptotic analysis of a coupl…

math.OC2016

Random linear under-determined systems with block-sparse solutions -- asymptotics, large deviations, and finite dimensions

Mihailo Stojnic

In this paper we consider random linear under-determined systems with block-sparse solutions. A standard subvariant of such systems, namely, precisely the same type of systems with…

math.OC2016

Random linear systems with sparse solutions -- asymptotics and large deviations

Mihailo Stojnic

In this paper we revisit random linear under-determined systems with sparse solutions. We consider optimization heuristic known to work very well when used to solve these…