Quasimonotone random and stochastic functional differential equations with applications

In this paper, we study monotone properties of random and stochastic functional differential equations and their global dynamics. First, we show that random functional differential equations(RFDEs)generate the random dynamical system(RDS) if and only if all the solutions are globally defined, and establish the comparison theorem for RFDEs and the random Riesz representation theorem. These three results lead to the Borel measurability of coefficient functions in the Riesz representation of variational equations for quasimonotone RFDEs, which paves the way following the Smith line to establish eventual strong monotonicity for the RDS under cooperative and irreducible conditions. Then strong comparison principles, strong sublinearity theorems and the existence of random attractors for RFDEs are proved. Finally, criteria are presented for the existence of a unique random equilibrium and its global stability in the universe of all the tempered random closed sets of the positive cone. Applications to typical random or stochastic delay models in monotone dynamical systems,such as biochemical control circuits, cyclic gene models and Hopfield-type neural networks, are given.

An Inexact Proximal Method with Proximal Distances for Quasimonotone Equilibrium Problems

In this paper,we propose an inexact proximal point method to solve equilibrium problems 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 by the method converges to a solution point of the problem.

ON ALTERNATIVE OPTIMAL SOLUTIONS TO QUASIMONOTONIC PROGRAMMING WITH LINEAR CONSTRAINTS

In this paper, the nonlinear programming problem with quasimonotonic （ both quasiconvex and quasiconcave ）objective function and linear constraints is considered. With the decomposition theorem of polyhedral sets, the structure of optimal solution set for the programming problem is depicted. Based on a simplified version of the convex simplex method, the uniqueness condition of optimal solution and the computational procedures to determine all optimal solutions are given, if the uniqueness condition is not satisfied. An illustrative example is also presented.

Strict Feasibility of Variational Inequalities in Reflexive Banach Spaces

Strict feasibility is proved to be an equivalent characterization of （dual） variational inequalities having a nonempty bounded solution set, provided the mappings involved are stably properly quasimonotone. This generalizes an earlier result from finite-dimensional Euclidean spaces to infinitedimensional reflexive Banach spaces. Moreover, the monotonicity-type assumptions are also mildly relaxed.