A simple projection algorithm for linear programming problems

DOI10.1007/s00453-018-0436-3zbMath1423.90137OpenAlexW2796313232MaRDI QIDQ1755785

Noriyoshi Sukegawa, Tomonari Kitahara

Publication date: 11 January 2019

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00453-018-0436-3

zbMATH Keywords

linear programmingprojectionzonotopebinary search

Mathematics Subject Classification ID

Linear programming (90C05) Methods of quasi-Newton type (90C53)

Related Items (1)

Extension of the LP-Newton method to conic programming problems via semi-infinite representation

Cites Work

• Unnamed Item
• Zonotopes and the LP-Newton method
• 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
• Personal reminiscence: combinatorial and discrete optimization problems in which I have been interested
• The LP-Newton method for standard form linear programming problems
• Submodular functions and optimization.
• A DUAL ALGORITHM FOR FINDING THE MINIMUM-NORM POINT IN A POLYTOPE
• Finding the nearest point in A polytope
• Lectures on Polytopes
• A DUAL ALGORITHM FOR FINDING A NEAREST PAIR OF POINTS IN TWO POLYTOPES
• On Zonotopes

This page was built for publication: A simple projection algorithm for linear programming problems