Finding the projection on a polytope: An iterative method (Q1352784): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: A recursive algorithm for finding the minimum norm point in a polytope and a pair of closest points in two polytopes / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Finding the nearest point in A polytope / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A linear algorithm for determining the separation of convex polyhedra / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A Subexponential Algorithm for Abstract Optimization Problems / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3141900 / rank | |||
Normal rank | |||
Latest revision as of 10:46, 27 May 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Finding the projection on a polytope: An iterative method |
scientific article |
Statements
Finding the projection on a polytope: An iterative method (English)
0 references
19 February 1997
0 references
projection of a point on a polytope
0 references
0 references
