Hamiltonian group actions on symplectic Deligne–Mumford stacks and toric orbifolds

We develop differential and symplectic geometry of differentiable Deligne–Mumford stacks (orbifolds) including Hamiltonian group actions and symplectic reduction. As an application we construct new examples of symplectic toric DM stacks.     

A Brylinski filtration for affine Kac–Moody algebras

Braverman and Finkelberg have recently proposed a conjectural analogue of the geometric Satake isomorphism for untwisted affine Kac–Moody groups. As part of their model, they conjecture that (at dominant weights) Lusztig's q-analog of weight multiplicity is equal to the Poincare series of the principal nilpotent filtration of the weight space, as occurs in the finite-dimensional case. We show that the conjectured equality holds for all affine Kac–Moody algebras if the principal nilpotent filtration is replaced by the principal Heisenberg filtration. The main body of the proof is a Lie algebra cohomology vanishing result. We also give an example to show that the Poincare series of the principal nilpotent filtration is not always equal to the q-analog of weight multiplicity. Finally, we give some partial results for indefinite Kac–Moody algebras.     

Stability results for properly quasi convex vector optimization problems

In this paper, we discuss the stability of the sets of (weak) minimal points and (weak) efficient points of vector optimization problems. Assuming that the objective functions are (strictly) properly quasi convex, and the data ofthe approximate problems converges to the data of the original problems in the sense of Painlevé–Kuratowski, we establish the Painlevé–Kuratowski set convergence of the sets of (weak) minimal points and (weak) efficient points of the approximate problems to the corresponding ones of original problem. Our main results improve and extend the results of the recent papers.     

On the finite termination of the Douglas-Rachford method for the convex feasibility problem

In this paper we apply the Douglas–Rachford (DR) method to solve the problem of finding a point in the intersection of the interior of a closed convex cone and a closed convex set in an infinite-dimensional Hilbert space. For this purpose, we propose two variants of the DR method which can find a point in the intersection in a finite number of iterations. In order to analyse the finite termination of the methods, we use some properties of the metric projection and a result regarding the rate of convergence of fixed point iterations. As applications of the results, we propose the methods for solving the conic and semidefinite feasibility problems, which terminate at a solution in a finite number of iterations.