I'd like to start by clarifying I'm by no means an expert in any of this, so take everything I say with a grain of salt.
Convex and Non-convex Optimization are subfields of mathematical optimization that focus on minimising convex and non-convex functions respectively. That is, finding the global minimum of functions with one or multiple minima.
Quadratic programming is also a subfield of mathematical optimization that also focuses on minimising convex and non-convex functions.
Convex and Non-convex Optimization seem to focus on quadratic functions, Quadratic programming also focuses on quadratic functions.
I do understand the difference between convex and non-convex optimization, but I'm having trouble understanding how quadratic programming fits into all of this.
I tried Googling my question in several different ways with no luck. I searched this website and it seems this question has never been asked before.
Is there an area of mathematical optimisation that quadratic programming doesn't cover? If there is, I can't seem to find a single example. If there isn't, it seems very odd to me that quadratic programming is differentiated enough that it has a completely separate name and Wikipedia page.