A simple projection algorithm for linear programming problems
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 2008526 (Why is no real title available?)
- A DUAL ALGORITHM FOR FINDING A NEAREST PAIR OF POINTS IN TWO POLYTOPES
- A DUAL ALGORITHM FOR FINDING THE MINIMUM-NORM POINT IN A POLYTOPE
- A recursive algorithm for finding the minimum norm point in a polytope and a pair of closest points in two polytopes
- An algorithm for finding the minimum-norm point in the intersection of a convex polyhedron and a hyperplane
- An algorithm for solving the minimum-norm point problem over the intersection of a polytope and an affine set
- Finding the nearest point in A polytope
- Lectures on Polytopes
- On Zonotopes
- Personal reminiscence: combinatorial and discrete optimization problems in which I have been interested
- Submodular functions and optimization.
- The LP-Newton method for standard form linear programming problems
- Zonotopes and the LP-Newton method
Cited in
(5)- scientific article; zbMATH DE number 4119925 (Why is no real title available?)
- A projective simplex algorithm using LU decomposition
- Extension of the LP-Newton method to conic programming problems via semi-infinite representation
- The LP-Newton method for standard form linear programming problems
- Two simplified affine projection algorithms
This page was built for publication: A simple projection algorithm for linear programming problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1755785)