1 — 08:30 — Projectional coderivatives with applications
In this talk we introduce a projectional coderivative of set-valued mappings and present its calculations in some special cases. We apply this coderivative to obtain a complete characterization for a set-valued mapping to have the Lipschitz-property relative to a closed and convex set. For an extended real-valued function, we apply the obtained results to investigate its Lipschitz continuity relative to a closed and convex set and the Lipschitz-like property of a level-set mapping relative to a half line. We apply our results to study the Lipschitz-like property of the solution mapping of a parametric affine variational inequality problem.
2 — 09:00 — Sorting Functions for Sparse Projection with Applications to Sparse Optimization
Motivated by the symmetric sparse projection results developed by Beck, Eldar, and Hallmark, we introduce a general notion of sorting function for sparse projection without imposing full permutation symmetry on an underlying set. If a sorting function is defined by the monotone order of a real-valued univariate function, then it is called a simple sorting function. For example, when an underlying set is nonnegative and fully permutation symmetric, it is known that its simple sorting function can be defined by
3 — 09:30 — A projection algorithm for nonlocal low-rank tensor models with orthogonal constraints
Hyperspectral images (HSIs) are often contaminated by mixed noises such as Gaussian noise, dead lines, stripes and so on. In this talk, we will present an optimization model for HSI denoising using a tensor