An algorithm for finding the minimum-norm point in the intersection of a convex polyhedron and a hyperplane
From MaRDI portal
(Redirected from Publication:1335567)
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
- scientific article; zbMATH DE number 3323651 (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 FAST ALGORITHM FOR SOLVING LARGE SCALE MEAN-VARIANCE MODELS BY COMPACT FACTORIZATION OF COVARIANCE MATRICES
- A Nearest Point Algorithm for Convex Polyhedral Cones and Applications to Positive Linear Approximation.
- A recursive algorithm for finding the minimum norm point in a polytope and a pair of closest points in two polytopes
- An Efficient Computational Procedure for a Generalized Quadratic Programming Problem
- An algorithm for finding the minimum-norm point in the intersection of a convex polyhedron and a hyperplane
- Convex Analysis
- Finding the Point of a Polyhedron Closest to the Origin
- Finding the nearest point in A polytope
- Linearly constrained estimation by mathematical programming
- Submodular functions and optimization
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 iterative algorithm for finding a nearest pair of points in two convex subsets of \(\mathbb{R}^n\)
- An interior-point method for minimizing convex functions on the convex hull of a point set
- 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)
