\def\r{ {\mathbb{r}} } \def\bbs{ {\mathbb s}} let $m_n (\bbs)^g$ denote $g$-tuples of $n \times n$ complex self-adjoint matrices. given tuples $x=(x_1, \dots, x_g) \in m_{n_1} (\bbs^g)$ and $y=(y_1, \dots, y_g) \in m_{n_2}(\bbs)^g$, a matrix convex combination of $x$ and $y$ is a sum of the form \[ v_1^* xv_1+v_2^* y v_2 \quad \quad \quad v_1^* v_1+v_2^* v_2=i_n \] where $v_1:m_{n} (\r) \to m_{n_1}$ and $v_2:m_n (\r) \to m_{n_2}$ are contractions. matrix convex sets are sets which are closed under matrix convex combinations. while in the classical setting there is only one good notion of an extreme point, there are three natural notions of extreme points for matrix convex sets: euclidean, matrix, and absolute extreme points. a central goal in the theory of matrix convex sets is to determine if one of these notions of extreme points for matrix convex sets is minimal with respect to spanning. matrix extreme points are the most restricted type of extreme point known to span matrix convex sets; however, they are not necessarily the smallest set which does so. absolute extreme points, a more restricted type of extreme points that are closely related to arveson's boundary, enjoy a strong notion of minimality should they span. however, until recently it has been unknown if general matrix convex sets are spanned by their absolute extreme points. this talk will give a class of closed bounded matrix convex sets which do not have absolute extreme points. the sets considered are noncommutative sets, $k_x$, formed by taking matrix convex combinations of a single tuple $x$. in the case that $x$ is a tuple of compact operators with no nontrivial finite dimensional reducing subspaces, $k_x$ is a closed bounded matrix convex set with no absolute extreme points.