The sparse linear programming(SLP) is a linear programming problem equipped with a sparsity constraint, which is nonconvex, discontinuous and generally NP-hard
Given a switched system,we introduce weakly mixing sets of type 1,2 and Xiong chaotic sets of type 1,2 with respect to a given set and show that they are equiva
In the framework of complete metric spaces, this paper provides several suffcient conditions for the well-posedness with respect to an admissible function, whic