Generalized Minty-Browder technique for a class of monotone type stochastic PDEs

In the first part of this talk, I will present the definitions and properties of accretive and monotone operators, and discuss some key results developed in the past few decades regarding the solvability of monotone type deterministic PDEs.

Later I will elaborately show an interesting technique (Generalized Minty-Browder Technique) which by exploiting the monotonicity argument, enables us to prove the solvability(strong solution) even in the stochastic case, and avoids the classical compactness method.