We present an approximate nonsmooth algorithm to solve a minimization problem. in which the objective function is the sum of a maximum eigenvalue function of matrices and a convex function. The essential idea to solve the optimization problem in this paper is similar to the thought of proximal bundle method. but the difference is that we choose approximate subgradient and function val... https://cosmeticssquadets.shop/product-category/cleansing-strips/