Finding the projection on a polytope: An iterative method
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 439380 (Why is no real title available?)
- A Subexponential Algorithm for Abstract Optimization Problems
- A linear algorithm for determining the separation of convex polyhedra
- A recursive algorithm for finding the minimum norm point in a polytope and a pair of closest points in two polytopes
- Finding the nearest point in A polytope
Cited in
(10)- Hausdorff matching and Lipschitz optimization
- An algorithm for solving the nearest point problem in an affine subspace
- Efficient computation of the Hausdorff distance between polytopes by exterior random covering
- scientific article; zbMATH DE number 3924512 (Why is no real title available?)
- An iterative algorithm for finding a nearest pair of points in two convex subsets of \(\mathbb{R}^n\)
- Fast projection method for a special class of polytopes with applications
- A finite algorithm for finding the projection of a point onto the canonical simplex of \({\mathbb R}^ n\)
- A Simultaneous Iterative Method for Computing Projections on Polyhedra
- scientific article; zbMATH DE number 3945874 (Why is no real title available?)
- Polynomial algorithms for projecting a point onto a region defined by a linear constraint and box constraints in \(\mathbb{R}^n\)
This page was built for publication: Finding the projection on a polytope: An iterative method
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1352784)
