{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T08:35:52Z","timestamp":1774946152041,"version":"3.50.1"},"reference-count":14,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1976,12,1]],"date-time":"1976-12-01T00:00:00Z","timestamp":218246400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Mathematical Programming"],"published-print":{"date-parts":[[1976,12]]},"DOI":"10.1007\/bf01580381","type":"journal-article","created":{"date-parts":[[2005,4,28]],"date-time":"2005-04-28T09:55:54Z","timestamp":1114682154000},"page":"128-149","source":"Crossref","is-referenced-by-count":226,"title":["Finding the nearest point in A polytope"],"prefix":"10.1007","volume":"11","author":[{"given":"Philip","family":"Wolfe","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"CR1","doi-asserted-by":"crossref","first-page":"415","DOI":"10.1137\/0307030","volume":"7","author":"R.O. Barr","year":"1969","unstructured":"R.O. Barr, \u201cAn efficient computational procedure for a generalized quadratic programming problem\u201d,SIAM Journal on Control 7 (1969) 415\u2013429.","journal-title":"SIAM Journal on Control"},{"key":"CR2","unstructured":"L.C. Barbosa and E. Wong, \u201cOn a class of iterative algorithms for linear inequalities with applications to pattern classification\u201d, in:Proceedings of the first annual Princeton conference of information sciences and systems, 1967, pp. 86\u201389."},{"key":"CR3","volume-title":"\u201cThe determination of optimum separating hyperplanes I. A finite step procedure\u201d, RC 2023","author":"M.D. Canon","year":"1968","unstructured":"M.D. Canon and C.D. Cullum, \u201cThe determination of optimum separating hyperplanes I. A finite step procedure\u201d, RC 2023, IBM Watson Research Center, Yorktown Heights, New York (February, 1968)."},{"key":"CR4","volume-title":"Linear programming and extensions","author":"G.B. Dantzig","year":"1963","unstructured":"G.B. Dantzig,Linear programming and extensions (Princeton University Press, Princeton, N.J. 1963)."},{"key":"CR5","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1137\/0304007","volume":"4","author":"E.G. Gilbert","year":"1966","unstructured":"E.G. Gilbert, \u201cAn iterative procedure for computing the minimum of a quadratic form on a convex set\u201d,SIAM Journal on Control 4 (1966) 61\u201380.","journal-title":"SIAM Journal on Control"},{"key":"CR6","volume-title":"Integer and nonlinear programming","author":"G.H. Golub","year":"1970","unstructured":"G.H. Golub and M.A. Saunders, Linear least squares and quadratic programming, in: J. Abadie, ed.,Integer and nonlinear programming (North-Holland, Amsterdam, 1970) Ch. 10."},{"key":"CR7","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1007\/BF01681343","volume":"9","author":"B. Hohenbalken von","year":"1975","unstructured":"B. von Hohenbalken, \u201cA finite algorithm to maximize certain pseudoconcave functions on polytopes\u201d,Mathematical Programming 9 (1975) 189\u2013206.","journal-title":"Mathematical Programming"},{"key":"CR8","doi-asserted-by":"crossref","first-page":"444","DOI":"10.1287\/opre.13.3.444","volume":"13","author":"O.L. Mangasarian","year":"1965","unstructured":"O.L. Mangasarian, \u201cLinear and nonlinear separation of patterns by linear programming\u201d,Operations Research 13 (1965) 444\u2013452.","journal-title":"Operations Research"},{"key":"CR9","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1137\/0312003","volume":"12","author":"B.F. Mitchell","year":"1974","unstructured":"B.F. Mitchell, V.F. Demyanov, and V.N. Malozemov, \u201cFinding the point of a polyhedron closest to the origin\u201d,SIAM Journal on Control 12 (1974) 19\u201326.","journal-title":"SIAM Journal on Control"},{"key":"CR10","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-46216-0","volume-title":"Convexity and optimization in finite dimensions I","author":"J. Stoer","year":"1970","unstructured":"J. Stoer and C. Witzgall,Convexity and optimization in finite dimensions I (Springer, Berlin, 1970)."},{"key":"CR11","doi-asserted-by":"crossref","unstructured":"D.R. Wilhelmsen, A linear algorithm for generating positive weight cubatures,Mathematics of Computation 30 (1976) to appear.","DOI":"10.2307\/2005429"},{"key":"CR12","unstructured":"C. Witzgall, correspondence with P. Wolfe (December, 1974)."},{"key":"CR13","first-page":"1","volume-title":"Integer and nonlinear programming","author":"P. Wolfe","year":"1970","unstructured":"P. Wolfe, \u201cConvergence theory in nonlinear programming\u201d, in: J. Abadie, ed.,Integer and nonlinear programming, (North-Holland, Amsterdam, 1970) pp. 1\u201336."},{"key":"CR14","doi-asserted-by":"crossref","first-page":"190","DOI":"10.1007\/BFb0121249","volume":"1","author":"P. Wolfe","year":"1974","unstructured":"P. Wolfe, \u201cAlgorithm for a least-distance programming problem\u201d,Mathematical Programming Study 1 (1974) 190\u2013205.","journal-title":"Mathematical Programming Study"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01580381.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01580381\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01580381","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,7]],"date-time":"2020-04-07T03:56:27Z","timestamp":1586231787000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01580381"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1976,12]]},"references-count":14,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1976,12]]}},"alternative-id":["BF01580381"],"URL":"https:\/\/doi.org\/10.1007\/bf01580381","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[1976,12]]}}}