A method for approximating the solution set of a system of convex inequalities by polytopes
From MaRDI portal
Publication:1182665
DOI10.1016/0377-0427(91)90012-9zbMath0743.65056MaRDI QIDQ1182665
Publication date: 28 June 1992
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(91)90012-9
triangulation; convex optimization; polytopes; Hausdorff metric; convex set; system of convex inequalities; simplicial division procedures
65K05: Numerical mathematical programming methods
90C25: Convex programming
52A20: Convex sets in (n) dimensions (including convex hypersurfaces)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Relaxed outer projections, weighted averages and convex feasibility
- Volume approximation of convex bodies by inscribed polytopes
- A finitely convergent ``row-action method for the convex feasibility problem
- Parallel application of block-iterative methods in medical imaging and radiation therapy
- Error bounds for the method of alternating projections
- Polygonal approximation of plane convex bodies
- Extensions of Lemke's algorithm for the linear complementarity problem
- Block-iterative projection methods for parallel computation of solutions to convex feasibility problems
- On the behavior of a block-iterative projection method for solving convex feasibility problems
- An Algorithm for Finding All Vertices of Convex Polyhedral Sets
- Cyclic subgradient projections
- Convergence Conditions for Nonlinear Programming Algorithms
- An iterative method, having linear rate of convergence, for solving a pair of dual linear programs
- On Inscribing n-Dimensional Sets in a Regular n-Simplex
