Zonotopes and the LP-Newton method
From MaRDI portal
Publication:833464
DOI10.1007/s11081-008-9067-xzbMath1180.90185OpenAlexW2016999408MaRDI QIDQ833464
Satoru Fujishige, Takumi Hayashi, Kei Yamashita, Uwe T. Zimmermann
Publication date: 12 August 2009
Published in: Optimization and Engineering (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11081-008-9067-x
Related Items
Personal reminiscence: combinatorial and discrete optimization problems in which I have been interested, An update-and-stabilize framework for the minimum-norm-point problem, The LP-Newton method for standard form linear programming problems, Extension of the LP-Newton method to conic programming problems via semi-infinite representation, A simple projection algorithm for linear programming problems, Deepest point of a polyhedron and linear programming
Cites Work
- Unnamed Item
- Unnamed Item
- A Newton method for linear programming
- Newton's method and its use in optimization
- A polynomial-time algorithm, based on Newton's method, for linear programming
- Implementing proximal point methods for linear programming
- Projection algorithms for linear programming
- 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
- Convex combinatorial optimization
- Polybasic polyhedra: Structure of polyhedra with edge vectors of support size at most 2
- The many facets of linear programming
- A strongly polynomial algorithm for line search in submodular polyhedra
- The use of edge-directions and linear programming to enumerate vertices
- Submodular functions and optimization.
- On the equivalence between some discrete and continuous optimization problems
- A DUAL ALGORITHM FOR FINDING THE MINIMUM-NORM POINT IN A POLYTOPE
- Linear programming by minimizing distances
- Finding the nearest point in A polytope
- Directional-Quasi-Convexity, Asymmetric Schur-Convexity and Optimality of Consecutive Partitions
- A DUAL ALGORITHM FOR FINDING A NEAREST PAIR OF POINTS IN TWO POLYTOPES
- On Zonotopes
