Consisting of two parts, this work presents the main notions of abstract convexity and their applications in the study of some classes of functions and sets. It examines both theoretical and numerical aspects of global optimization based on abstract convexity. It is of interest to specialists in global optimization, and mathematical programming.