Least distance methods for the frame of homogeneous equation systems

DOI10.1016/0377-0427(87)90192-0zbMath0637.65059OpenAlexW2042710468MaRDI QIDQ1098570

James E. Lewis, Balder von Hohenbalken, Bruce L. Clarke

Publication date: 1987

Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-0427(87)90192-0

zbMATH Keywords

algorithmsconvex hullnonnegative solutionsframesimplexcone Ccorral methodedge methodexternal and internal representationleast distance methodssimplicial decomposition algorithms

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Software, source code, etc. for problems pertaining to convex and discrete geometry (52-04) Linear programming (90C05) Linear inequalities of matrices (15A39) Software, source code, etc. for problems pertaining to linear algebra (15-04) Polytopes and polyhedra (52Bxx)

Cites Work

• A finite algorithm to maximize certain pseudoconcave functions on polytopes
• Finding the nearest point in A polytope
• Least distance methods for the scheme of polytopes

This page was built for publication: Least distance methods for the frame of homogeneous equation systems