Smoothing algorithms for computing the projection onto a Minkowski sum of convex sets

Abstract

In this paper, the problem of computing the projection, and therefore the minimum distance, from a point onto a Minkowski sum of general convex sets is studied. Our approach is based on the minimum norm duality theorem originally stated by Nirenberg and the Nesterov smoothing techniques. It is shown that projection points onto a Minkowski sum of sets can be represented as the sum of points on constituent sets so that, at these points, all of the sets share the same normal vector which is the negative of the dual solution. The proposed NESMINO algorithm improves the theoretical bound on number of iterations from Op 1 q by Gilbert [SIAM J. Contr., vol. 4, pp. 61-80, 1966] to O´1 ? lnp 1 q¯, where is the desired accuracy for the objective function. Moreover, the algorithm also provides points on each component sets such that their sum is equal to the projection point.

Parallel Tseng’s Extragradient Methods for Solving Systems of Variational Inequalities on Hadamard Manifolds

“…It is well known that the variational inequality theory has been playing a big role in the study of signal processing, image reconstruction, mathematical programming, differential equations, and others; see, e.g., [1][2][3][4][5]. A large number of numerical methods has been designed for solving the VIPs and related optimization problems; see, e.g., [6][7][8][9][10]. With the help of an additional projection operator, Korpelevich [11] first introduced…”

Hybrid Algorithms for Variational Inequalities Involving a Strict Pseudocontraction

“…Lemma 5. Let {τ n } be generated by (2). Then, {τ n } is a nonincreasing sequence with τ n ≥τ := min{τ 1 , µ L } ∀n ≥ 1 and lim n→∞ τ n ≥τ := min{τ 1 , µ L }.…”

“…The gradient (reduced) type iterative schemes are under the spotlight of investigators of applied mathematicians and engineers in the communities of nonlinear and optimization. Based on this approach, a number of authors have conducted various investigations on efficient iterative algorithms; for examples, see [2][3][4][5][6][7][8][9][10][11].…”

Composite inertial subgradient extragradient methods for variational inequalities and fixed point problems

“…It is well known that the class of strict pseudocontractions includes the class of nonexpansive mappings and is also continuous. From their direct and indirect applications to other branches of mathematics and other engineering fields, to the the class of nonexpansive operators and the class of strictly pseudocontractive operators are now under the spotlights; see, e.g., [1][2][3][4][5][6][7][8] and the references therein.…”