This paper provides new versions of the Farkas lemma characterizing those inequalities of the form f(x) ≥ 0 which are consequences of a composite convex inequality (S ◦ g)(x) ≤ 0 on a closed convex subset of a given locally convex topological vector space X, where f is a proper lower semicontinuous convex function defined on X, S is an extended sublinear function, and g is a vector-valued S-con...

An iterative method is proposed to construct the Bregman projection of a point onto a countable intersection of closed convex sets in a reflexive Banach space. 1. Problem statement Let (X , ‖ · ‖) be a reflexive real Banach space with dual (X ∗, ‖ · ‖∗) and let f : X → ]−∞,+∞] be a lower semicontinuous (l.s.c.) convex function which is Gâteaux differentiable on int dom f 6= Ø and Legendre [1, D...

Semi-supervised Support vector machine has become an increasingly popular tool for machine learning due to its wide applicability. Unlike SVM, their formulation leads to a non-smooth non-convex optimization problem. In 2005, Chapelle and Zien used a Gaussian approximation as a smooth function and presented ∇TSVM. In this paper, we propose a smooth piecewise function and research smooth piecewis...