From Global Optimization to Rough Analysis

Hoang Xuan Phu
Institute of Mathematics
Vietnamese Academy of Science and Technology

Abstract:

The so-called Rough Analysis is an approach to rough worlds which do not have fine behaviors, e.g., things of the material universe or objects represented by digital computers.

This talk begins with the starting module of the Rough Analysis, namely the gamma-subdifferential and the gamma-convexity, which were introduced to state necessary and sufficient conditions for global minimizers of not necessarily continuous functions.

After that, some basic ideas of the Rough Analysis are presented by some of its building blocks, such as rough convexity, rough convergence, rough continuity, and fixed-point theorems of roughly continuous mappings.