In this paper we propose an inexact proximal point method to solve equilibrium problem using proximal distances and the diagonal subdifferential. Under some natural assumptions on the problem and the quasimonotonicity condition on the bifunction, we prove that the sequence generated for the method converges to a solution point of the problem.

We prove the existence of viable solutions for an autonomous second-order functional differential inclusions in the case when the multifunction that define the inclusion is upper semicontinuous compact valued and contained in the subdifferential of a proper lower semicontinuous convex function.

The existence of monotone solutions for a second-order functional differential inclusion is obtained in the case when the multifunction that define the inclusion is upper semicontinuous compact valued and contained in the Fréchet subdifferential of a φ-convex function of order two.

In this paper we study a nonlinear evolution inclusion of subdifferential type in Hilbert spaces. The perturbation term is Hausdorff continuous in the state variable and has closed but not necessarily convex values. Our result is a stochastic generalization of an existence theorem proved by Kravvaritis and Papageorgiou in [6].

We study subdifferential conditions of the calmness property for multifunctions representing convex constraint systems in a Banach space. Extending earlier work in finite dimensions [R. Henrion and J. Outrata, J. Math. Anal. Appl., 258 (2001), pp. 110–130], we show that, in contrast to the stronger Aubin property of a multifunction (or metric regularity of its inverse), calmness can be ensured ...

-In this paper, we investigate some properties of Michel Penot subdifferentials of locally Lipschitz functions and establish Lagrange multiplier rule in terms of Michel-Penot subdifferentials for nonsmooth mathematical programming problem. Key-Words: Nonsmooth optimization; approximate subdifferentials; generalized gradient; Michel Penot subdifferential; Banach space.

‎This paper proposes a new form of optimization problem which is a two-level programming problem with infinitely many lower level constraints‎. ‎Firstly‎, ‎we consider some lower level constraint qualifications (CQs) for this problem‎. ‎Then‎, ‎under these CQs‎, ‎we derive formula for estimating the subdifferential of its valued function‎. ‎Finally‎, ‎we present some necessary optimality condit...