Pages that link to "Item:Q1335567"
From MaRDI portal
The following pages link to An algorithm for finding the minimum-norm point in the intersection of a convex polyhedron and a hyperplane (Q1335567):
Displaying 15 items.
- An active index algorithm for the nearest point problem in a polyhedral cone (Q548684) (← links)
- Zonotopes and the LP-Newton method (Q833464) (← links)
- Smallest point of a polytope (Q1117135) (← 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 analytical solution to the minimum \(L_ p\)-norm of a hyperplane (Q1363554) (← links)
- An algorithm for solving the minimum-norm point problem over the intersection of a polytope and an affine set (Q1579636) (← links)
- An iterative algorithm for finding a nearest pair of points in two convex subsets of \(\mathbb{R}^n\) (Q1591950) (← 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)
- A new computational technique for common solutions between systems of generalized mixed equilibrium and fixed point problems (Q2375441) (← links)
- ALGORITHMS FOR BALL HULLS AND BALL INTERSECTIONS IN NORMED PLANES (Q2970416) (← links)
- A DUAL ALGORITHM FOR FINDING THE MINIMUM-NORM POINT IN A POLYTOPE (Q3197625) (← links)
- The Minimum Euclidean-Norm Point in a Convex Polytope: Wolfe's Combinatorial Algorithm is Exponential (Q5216797) (← links)
- The minimum Euclidean-norm point in a convex polytope: Wolfe's combinatorial algorithm is exponential (Q5230318) (← links)
