Sum Formula for Maximal Abstract Monotonicity and Abstract Rockafellar’s Surjectivity Theorem

Authors

A. R. Doagooei

H. Mohebi

Abstract:

In this paper, we present an example in which the sum of two maximal abstract monotone operators is maximal. Also, we shall show that the necessary condition for Rockafellar’s surjectivity which was obtained in ([19], Theorem 4.3) can be sufficient.

Upgrade to premium to download articles

Already have an account?login

similar resources

Sum of Abstract Domains

In the abstract interpretation theory, program properties are encoded by abstract domains, and the combination of abstract domains leads to new properties to be analyzed. We propose a new method to combine numerical abstract domains based on the Minkowski sum. We provide a general framework equipped with all the necessary abstract operators for static analysis of imperative languages.

full text