In this paper we propose distributed dual gradient algorithms for linearly constrained separable convex problems and analyze their rate of convergence under different assumptions. Under the strong convexity assumption on the primal objective function we propose two distributed dual fast gradient schemes for which we prove sublinear rate of convergence for dual suboptimality but also primal subo...

Consider a sequence of AG codes evaluating at a set of evaluation points P1, . . . , Pn the functions having only poles at a defining point Q, with the sequence of codes satisfying the isometry-dual condition (i.e. containing at the same time primal and their dual codes). We prove a necessary condition under which, after taking out a number of evaluation points (i.e. puncturing), the resulting ...

The intuitionistic fuzzification of (strong, weak, s-weak) hyperBCK-ideals is introduced, and related properties are investigated. Characterizationsof an intuitionistic fuzzy hyper BCK-ideal are established. Using acollection of hyper BCK-ideals with some conditions, an intuitionistic fuzzyhyper BCK-ideal is built.

In this paper, we have introduced the notion of vague Lie ideal and have studied their related properties. The cartesian products of vague Lie ideals are discussed. In particular, the Lie homomorphisms between the vague Lie ideals of a Lie algebra and the relationship between the domains and the co-domains of the vague Lie ideals under these Lie homomorphisms are investigated. Mathematics subje...

We propose several variants of the primal-dual method due to Chambolle and Pock. Without requiring full strong convexity of the objective functions, our methods are accelerated on subspaces with strong convexity. This yields mixed rates, O (1/N 2) with respect to initialisation andO (1/N ) with respect to the dual sequence, and the residual part of the primal sequence. We demonstrate the e cacy...