MSM

Pippenger

This is the basic algorithm to optimize MSM. It doesn't leverage curve structure or anything.

Original paper: Faster Point Multiplication on Elliptic Curves with Efficient Endomorphisms
To read about endomorphisms: "Guide to Elliptic Curve Cryptography" Darrel Hankerson, Alfred Menezes, Scott Vanstone
Link it seems that GLV stops being useful after 2^12 points.

Mixed addition is adding a point in affine to a point in other coordinate system.
In a short weierstrass curve, you have different types of coordinate system: affine, projective, jacobian and extended jacobian.
Uses jacobian extended coordinates. These are the fastest when a curve is in short weierstrass form.
Uses twisted edwards for mixed addition over BLS* curves.
Twisted edwards for mixed addition is even better than extended jacobian in short weierstrass. It also uses an extended coordinate system over twisted edwards.

When splitting each coefficient $a_{i}$ of $b$ bits into chunks $a_{ij}$ of $c$ bits, you end up with $2^{c}$ possibilities for each coefficient. You can reduce this to $2^{c - 1}$ using "signed digit decomposition". When a chunk $a_{i} j$ is lower than $2^{c - 1}$ it stays the same. When a chunk $a_{i} j$ is greater than $2^{c - 1}$ , then you can substract $2^{c} - 1$ from it an add $1$ to the next chunk $a_{i, j + 1}$ .