Monotone Operators in Mathematical Programming.

摘要

An algorithm was investigated for solving problems where the object is to find x epsilon A and y epsilon A with y epsilon T(x), where T is a maximal monotone multifunction. An algorithm was described for finding a feasible point for a system of linear inequalities. For inconsistent systems, the feasible point algorithm was shown to generate a sequence converging at a linear rate to the set of least-square solutions. A primal-dual decomposition method was investigated to solve the separable convex programming problem. (Author)