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 PhysicsPublished 1 January 1967
L.M. Bregman
Citations2,659
Generate an AI Snapshot to get a quick, structured summary of this paper.
Study Snapshot
ObjectiveStudy objective
MethodsResearch methodology
PopulationPopulation studied
Sample sizeSample sizes
OutcomesStudy outcomes here
ResultsStudy results comes here
LimitationsResearch study limitations comes here
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
TL;DR
This method can be regarded as a generalization of the methods discussed in [1–4] and applied to the approximate solution of problems in linear and convex programming.
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.
Keywords
Computer ScienceMathematicsEngineering
Canadian Journal of MathematicsThe Relaxation Method for Linear Inequalities
560 Citations1954Shmuel Agmon
Canadian Journal of MathematicsThe Relaxation Method for Linear Inequalities
465 Citations1954T. S. Motzkin, I. J. Schoenberg
IBM Journal of Research and DevelopmentA Duality Theorem for Convex Programs
60 Citations1960William S. Dorn
A proof is given for a duality theorem for a class of convex programs, i.e., constrained minimization of conveX functions, which is based on the inequality of the following type: For α ≥ 1, β ≥ 1 using LaSalle's inequality.