Brute force search algorithm for semidefinite programming (representation of spectrahedron)
The question is not very well defined.  E.g., if the SDP has an optimal solution, then "searching" that one optimal solution is (trivially) enough to find a good approximate (in fact optimal) solution.  Similarly, any algorithm that solves the SDP in finite time will find a "good approximate solution" while considering only finitely many points of the SDP.

But if you mean to ask whether the feasible region of every SDP is the convex closure of finitely many extreme points, or whether, for any SDP, there is a finite set $S$ of points in the feasible region such that, for any linear objective, some point in $S$ is approximately optimal, the answer is surely no.  

For example, fix $\epsilon&gt;0$ and consider the SDP
$$\min \{\epsilon X_{11} + X_{22} :
X\in\mathbb{R}^{2\times 2},~X \text{ p.s.d.}, X_{12} = X_{21} = 1\}.$$
The feasible region consists of 2d p.s.d. matrices of the form $\left(\begin{array}{cc}x&amp;1\\1&amp;y\end{array}\right)$. The matrix is p.s.d. iff $x,y&gt; 0$ and $xy\ge 1$.  So there are infinitely many matrices $X$ (those with $y=1/x$) in the feasible region that are not convex combinations of other matrices in the region.  

Further, the unique optimal point has $(x,y)=(1/\sqrt{\epsilon}, \sqrt{\epsilon})$ and has value $2\sqrt{\epsilon}$.  The feasible region is independent of $\epsilon$, and, for any finite subset $S$ of that feasible region (where $S$ is independent of $\epsilon$), letting $x' = \min\{ X_{22} : X\in S\} &gt; 0$, no point in $S$ has value less than $x'$.  So, for sufficiently small $\epsilon$ (where $\sqrt\epsilon \ll x'$), no point in $S$ approximates the optimum well.