Finding the projection on a polytope: An iterative method (Q1352784): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0898-1221(96)00164-2 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2056102248 / rank
 
Normal rank
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