Zonotopes and the LP-Newton method
From MaRDI portal
Publication:833464
DOI10.1007/S11081-008-9067-XzbMATH Open1180.90185OpenAlexW2016999408MaRDI QIDQ833464FDOQ833464
Authors: 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
Recommendations
- A linear optimization oracle for zonotope computation
- Extremum problems for zonotopes
- Approximation of zonoids by zonotopes
- scientific article; zbMATH DE number 1830726
- Extension of the LP-Newton method to conic programming problems via semi-infinite representation
- NEWTON FLOW AND INTERIOR POINT METHODS IN LINEAR PROGRAMMING
- The LP-Newton method for standard form linear programming problems
- Unified complexity analysis for Newton LP methods
- Constrained polynomial zonotopes
- Concave programming for minimizing the zero-norm over polyhedral sets
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- A polynomial-time algorithm, based on Newton's method, for linear programming
- Submodular functions and optimization.
- Finding the nearest point in A polytope
- On Zonotopes
- The many facets of linear programming
- Newton's method and its use in optimization
- Convex combinatorial optimization
- A Newton method for linear programming
- The use of edge-directions and linear programming to enumerate vertices
- 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
- Directional-Quasi-Convexity, Asymmetric Schur-Convexity and Optimality of Consecutive Partitions
- On the equivalence between some discrete and continuous optimization problems
- Implementing proximal point methods for linear programming
- 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
- Polybasic polyhedra: Structure of polyhedra with edge vectors of support size at most 2
- A strongly polynomial algorithm for line search in submodular polyhedra
- A DUAL ALGORITHM FOR FINDING THE MINIMUM-NORM POINT IN A POLYTOPE
- Linear programming by minimizing distances
- A DUAL ALGORITHM FOR FINDING A NEAREST PAIR OF POINTS IN TWO POLYTOPES
Cited In (8)
- A linear optimization oracle for zonotope computation
- Deepest point of a polyhedron and linear programming
- Title not available (Why is that?)
- A simple projection algorithm for linear programming problems
- Personal reminiscence: combinatorial and discrete optimization problems in which I have been interested
- Extension of the LP-Newton method to conic programming problems via semi-infinite representation
- The LP-Newton method for standard form linear programming problems
- An update-and-stabilize framework for the minimum-norm-point problem
This page was built for publication: Zonotopes and the LP-Newton method
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q833464)
