Local cone approximations in mathematical programming

Abstract

We show how to use intensively local cone approximations to obtain results in some fields of optimization theory as optimality conditions, constraint qualifications, mean value theorems and error bound. © 2014 Taylor & Francis.