Computational Subproblems

A short collection of the "trivial" optimization subproblems that actually take work to derive the first time.

Background and Description

If you read enough state-of-the-art literature, you will find authors claiming certain results are trivial. What they really mean, however, is that they are trivial once you know the solution. In first-order optimization, these trivial results often take the form of a subproblem. Before I could claim something trivial for myself, I often had to work it out on paper. This is a short documentation on a few of these "trivial" subproblems.

Read the notes

Step through the subproblem derivations and proof sketches.