Subgradient-like algorithms for variable inequalities

L.R. Lucambio Pérez | Bello Cruz, J.Y. | Bouza Allende, G.

Keywords: Convexity; Projection methods; Strong convergence; Subgradient algorithm

Consider the variable inequality problem, that is to nd a solution of the inclusion given by the sum of a function and a point-to-cone application. This problem can be seen as a generalization of the classical system inequality problem taking a variable order structure. Exploiting this special structure, we propose variants of the subgradient algorithm for solving a system of variable inequalities. Their convergence is analyzed under convex-like conditions.

Anexos:

• K-variable-inequalities19-11-2012-a.pdf