An algorithm for finding the minimum-norm point in the intersection of a convex polyhedron and a hyperplane
From MaRDI portal
Publication:1335567
DOI10.1007/BF03167224zbMATH Open0830.90118OpenAlexW1964877955MaRDI QIDQ1335567FDOQ1335567
Authors: Satoru Fujishige, H. Sato, Ping Zhan 
Publication date: 16 October 1994
Published in: Japan Journal of Industrial and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf03167224
Recommendations
- An algorithm for solving the minimum-norm point problem over the intersection of a polytope and an affine set
- An efficient algorithm for finding the minimum norm point in the convex hull of a finite point set in the plane
- A DUAL ALGORITHM FOR FINDING THE MINIMUM-NORM POINT IN A POLYTOPE
- A RECURSIVE ALGORITHM FOR FINDING THE MINIMUM NORM POINT IN AN UNBOUNDED POLYHEDRON
- A recursive algorithm for finding the minimum norm point in a polytope and a pair of closest points in two polytopes
- An interior-point method for minimizing convex functions on the convex hull of a point set
- A finite algorithm for concave minimization over a polyhedron
- An algorithm for concave integer minimization over a polyhedron
- An optimal algorithm for computing a minimum nested nonconvex polygon
- Minimization of convex functions on the convex hull of a point set
Cites Work
- Convex Analysis
- Title not available (Why is that?)
- Submodular functions and optimization
- Finding the nearest point in A polytope
- Finding the Point of a Polyhedron Closest to the Origin
- An Efficient Computational Procedure for a Generalized Quadratic Programming Problem
- A Nearest Point Algorithm for Convex Polyhedral Cones and Applications to Positive Linear Approximation.
- A FAST ALGORITHM FOR SOLVING LARGE SCALE MEAN-VARIANCE MODELS BY COMPACT FACTORIZATION OF COVARIANCE MATRICES
- 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
- A DUAL ALGORITHM FOR FINDING THE MINIMUM-NORM POINT IN A POLYTOPE
- A DUAL ALGORITHM FOR FINDING A NEAREST PAIR OF POINTS IN TWO POLYTOPES
- Linearly constrained estimation by mathematical programming
Cited In (16)
- Smallest point of a polytope
- Zonotopes and the LP-Newton method
- 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
- A simple projection algorithm for linear programming problems
- Personal reminiscence: combinatorial and discrete optimization problems in which I have been interested
- An active index algorithm for the nearest point problem in a polyhedral cone
- An efficient algorithm for finding the minimum norm point in the convex hull of a finite point set in the plane
- An interior-point method for minimizing convex functions on the convex hull of a point set
- An iterative algorithm for finding a nearest pair of points in two convex subsets of \(\mathbb{R}^n\)
- A new computational technique for common solutions between systems of generalized mixed equilibrium and fixed point problems
- ALGORITHMS FOR BALL HULLS AND BALL INTERSECTIONS IN NORMED PLANES
- A DUAL ALGORITHM FOR FINDING THE MINIMUM-NORM POINT IN A POLYTOPE
- An update-and-stabilize framework for the minimum-norm-point problem
- The Minimum Euclidean-Norm Point in a Convex Polytope: Wolfe's Combinatorial Algorithm is Exponential
- The minimum Euclidean-norm point in a convex polytope: Wolfe's combinatorial algorithm is exponential
This page was built for publication: An algorithm for finding the minimum-norm point in the intersection of a convex polyhedron and a hyperplane
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1335567)
