On the block-structured distance to non-surjectivity of sublinear mappings

We show that the block-structured distance to non-surjectivity of a set-valued sublinear mapping equals the reciprocal of a suitable block-structured norm of its inverse. This gives a natural generalization of the classical Eckart and Young identity for square invertible matrices. CitationMathematical Programming 103 (2005) pp. 561–573.

Convex- and Monotone- Transformable Mathematical Programming Problems and a Proximal-Like Point Method

The problem of finding singularities of monotone vectors fields on Hadamard manifolds will be considered and solved by extending the well-known proximal point algorithm. For monotone vector fields the algorithm will generate a well defined sequence, and for monotone vector fields with singularities it will converge to a singularity. It will be also shown how … Read more

Optimality Conditions for Vector Optimization with Set-Valued Maps

Based on near convexity, we introduce the concepts of nearly convexlike set-valued maps and nearly semiconvexlike set-valued maps, give some charaterizations of them, and investigate the relationships between them. Then a Farkas-Minkowski type alternative theorem is shown under the assumption of near semiconvexlikeness. By using the alternative theorem and some other lemmas, we establish necessary … Read more