It's kind of like convex optimization is English, and nonconvex optimization is non-English. I'm not sure it's possible to write a text on non-English.
That doesn't non-convex optimization problems are unsolvable, merely that there are many different attacks that aren't necessarily coherently linked. A few common ones include:
a) convex reformulation, where possible.
b) partitioning into convex regions (used in global optimization)
c) heuristic/evolutionary approaches
d) specialized approaches for particular problem structures like integer programs, complementarity problems etc. (there are good textbooks for these)
There are a few good surveys of the landscape however. Most are journal pubs. This text  seems to be a good one.