An algorithm for finding the minimum-norm point in the intersection of a convex polyhedron and a hyperplane

DOI10.1007/BF03167224zbMath0830.90118OpenAlexW1964877955MaRDI QIDQ1335567

Ping Zhan, Hiroko Sato, Satoru Fujishige

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

zbMATH Keywords

algorithmconvex polyhedronminimum-norm point

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Convex programming (90C25)

Related Items (6)

An algorithm for finding the minimum-norm point in the intersection of a convex polyhedron and a hyperplane ⋮ Zonotopes and the LP-Newton method ⋮ A new computational technique for common solutions between systems of generalized mixed equilibrium and fixed point problems ⋮ Personal reminiscence: combinatorial and discrete optimization problems in which I have been interested ⋮ A simple projection algorithm for linear programming problems ⋮ An algorithm for solving the minimum-norm point problem over the intersection of a polytope and an affine set

Cites Work

• Unnamed Item
• Submodular functions and optimization
• Linearly constrained estimation by mathematical 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
• 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.
• Finding the nearest point in A polytope
• Finding the Point of a Polyhedron Closest to the Origin
• A DUAL ALGORITHM FOR FINDING A NEAREST PAIR OF POINTS IN TWO POLYTOPES
• An Efficient Computational Procedure for a Generalized Quadratic Programming Problem
• Convex Analysis

This page was built for publication: An algorithm for finding the minimum-norm point in the intersection of a convex polyhedron and a hyperplane