Pages that link to "Item:Q3197625"
From MaRDI portal
The following pages link to A DUAL ALGORITHM FOR FINDING THE MINIMUM-NORM POINT IN A POLYTOPE (Q3197625):
Displayed 10 items.
- Zonotopes and the LP-Newton method (Q833464) (← links)
- An approximate algorithm for computing multidimensional convex hulls (Q1294388) (← links)
- An interior point algorithm for large scale portfolio optimization (Q1313173) (← links)
- A recursive algorithm for finding the minimum norm point in a polytope and a pair of closest points in two polytopes (Q1315417) (← links)
- An algorithm for finding the minimum-norm point in the intersection of a convex polyhedron and a hyperplane (Q1335567) (← links)
- An efficient algorithm for finding the minimum norm point in the convex hull of a finite point set in the plane (Q1342092) (← links)
- An algorithm for solving the minimum-norm point problem over the intersection of a polytope and an affine set (Q1579636) (← links)
- A simple projection algorithm for linear programming problems (Q1755785) (← links)
- Personal reminiscence: combinatorial and discrete optimization problems in which I have been interested (Q1926640) (← links)
- Error bounds for solutions of linear equations and inequalities (Q4837939) (← links)