Hostname: page-component-78c5997874-xbtfd Total loading time: 0 Render date: 2024-11-17T22:23:20.313Z Has data issue: false hasContentIssue false
  • English
  • Français

The Relaxation Method for Linear Inequalities

Published online by Cambridge University Press:  20 November 2018

T. S. Motzkin  and
I. J. Schoenberg
T. S. Motzkin
Affiliation:
University of California, Los Angeles
I. J. Schoenberg
Affiliation:
University of Pennsylvania
Rights & Permissions [Opens in a new window]

Extract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

Let A be a closed set of points in the n-dimensional euclidean space En. If p and p1 are points of En such that

1.1

then p1 is said to be point-wise closer than p to the set A. If p is such that there is no point p1 which is point-wise closer than p to A, then p is called a closest point to the set A.

Type
Research Article
Information
Canadian Journal of Mathematics , Volume 6 , 1954 , pp. 393 - 404
Copyright
Copyright © Canadian Mathematical Society 1954

References

1. Agmon, S., The relaxation method for linear inequalities, Can. J. Math., 6 (1954), 382–392.Google Scholar
2. Fejér, L., Ueber die Lage der Nullstellen von Polynomen, die aus Minimum]orderungen gewisser Arten entspringen, Math. Annalen, 85 (1922), 41–48.Google Scholar