@thoni

The relaxation method of finding the common point of convex sets and its application to the solution of problems in convex programming

. USSR Computational Mathematics and Mathematical Physics, 7 (3): 200 - 217 (1967)
DOI: https://doi.org/10.1016/0041-5553(67)90040-7

Abstract

IN this paper we consider an iterative method of finding the common point of convex sets. This method can be regarded as a generalization of the methods discussed in 1–4. Apart from problems which can be reduced to finding some point of the intersection of convex sets, the method considered can be applied to the approximate solution of problems in linear and convex programming.

Description

The relaxation method of finding the common point of convex sets and its application to the solution of problems in convex programming - ScienceDirect

Links and resources

Tags