RESEARCH COMMONS
LIBRARY

A Method for Approximating the Solution Set of a System of Convex Inequalities by Polytopes

ResearchCommons/Manakin Repository

A Method for Approximating the Solution Set of a System of Convex Inequalities by Polytopes

Show simple item record

dc.contributor.author Censor, Yair en
dc.contributor.author Butnariu, Dan en
dc.date.accessioned 2010-06-09T15:44:56Z en
dc.date.available 2010-06-09T15:44:56Z en
dc.date.issued 1990-12 en
dc.identifier.uri http://hdl.handle.net/10106/2446 en
dc.description.abstract In this note a method for computing approximations by polytopes of the solution set [see pdf for notation] of a system of convex inequalities is presented. It is shown that such approximations can be determined by an algorithm which converges in finitely many steps when the solution set of the given system of inequalities is bounded. In this case, the algorithm generates "inner" and "outer' approximations having the Hausdorff distance to each other (and to the set [see pdf for notation]) not greater than an a priori fixed [see pdf for notation] and having their extremal points in [see pdf for notation] and in the relative exterior of [see pdf for notation], respectively. en
dc.language.iso en_US en
dc.publisher University of Texas at Arlington en
dc.relation.ispartofseries Technical Report;276 en
dc.subject Simplex en
dc.subject Convex set en
dc.subject Polytope en
dc.subject Triangulation en
dc.subject Refinement of a triangulation en
dc.subject Hausdorff metric en
dc.subject g-marginal vertex en
dc.subject.lcsh Mathematics Research en
dc.title A Method for Approximating the Solution Set of a System of Convex Inequalities by Polytopes en
dc.type Technical Report en
dc.publisher.department Department of Mathematics en

Files in this item

Files Size Format View Description
MathTechReport276.pdf 1.199Mb PDF View/Open PDF

This item appears in the following Collection(s)

Show simple item record

Browse

My Account

Statistics

About Us