After failing to "strong pass" one of my program's qualifying exams, I decided to enhance my studying by developing a somewhat detailed set of notes for the exam.

My master's thesis studied lower complexity bounds for binary logistic regression problems. It would go on to result in a publication in the AIMS IPI journal.

A brief look at a popular smoothing method in nonlinear convex optimization.

A look into some interesting connections that I made as a graduate student.

Some "trivial" problems according to popular literature aren't often very trivial at first glance. I frequently resorted to working out and documenting some of these trivial problems.

My dissertation is the result of multiple works throughout my time as a graduate student and was centered around improving first-order methods for solving convex optimization problems.

After renewed interest from the community, I set out to quantitatively rank the various Pokemon types. This turned out to be a richer problem than anticipated - leading to multiple unique perspectives and solutioning techniques.

My wife bought me a relatively simple dice game for Christmas. Although I thought the game was trivial, it seemed everyone else in the family had significantly more success than I did. I set out to determine if this was due to my poor gameplay or just sheer bad luck.

A new mechanic was introduced into the Pokemon games, and I had to study it to find out how strong it was.

Some renewed interest in playing Texas Hold'em had me questioning how far I could go on math alone. The answer turned out to be a little surprising.

I couldn't justify ranking my favorite college football team at the top of the league, so I had to make up my own ranking system. Backed with simple graph theory, I constructed a topological ordering of the best 100 college football teams.