Finding the Point of a Polyhedron Closest to the Origin
From MaRDI portal
Publication:4403397
DOI10.1137/0312003zbMath0277.52007OpenAlexW2159168492MaRDI QIDQ4403397
B. F. Mitchell, Vasily N. Malozemov, V. F. Dem'yanov
Publication date: 1974
Published in: SIAM Journal on Control (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0312003
Related Items (39)
An algorithm for finding the minimum-norm point in the intersection of a convex polyhedron and a hyperplane ⋮ Combination of steepest descent and BFGS methods for nonconvex nonsmooth optimization ⋮ An efficient algorithm for finding the minimum norm point in the convex hull of a finite point set in the plane ⋮ A Method for Minimization of Quasidifferentiable Functions ⋮ An analytical solution to the minimum \(L_ p\)-norm of a hyperplane ⋮ A trust region method for solving linearly constrained locally Lipschitz optimization problems ⋮ Smallest point of a polytope ⋮ A maximum \(L_p\) distance problem ⋮ \(L_{1}\)-norm loss based twin support vector machine for data recognition ⋮ Linear convergence rate for the MDM algorithm for the nearest point problem ⋮ The problem of projecting the origin of Euclidean space onto the convex polyhedron ⋮ Selective bi-coordinate method for limit non-smooth resource allocation type problems ⋮ Riemannian optimization via Frank-Wolfe methods ⋮ On the MDM method for solving the general quadratic problem of mathematical diagnostics ⋮ An effective nonsmooth optimization algorithm for locally Lipschitz functions ⋮ Clipping algorithms for solving the nearest point problem over reduced convex hulls ⋮ An iterative algorithm learning the maximal margin classifier. ⋮ Review of works by V. A. Yakubovich's scientific school on artificial intelligence and robotics ⋮ An effective method to determine whether a point is within a convex hull and its generalized convex polyhedron classifier ⋮ A framework for co-optimization algorithm performance and its application to worst-case optimization ⋮ A general soft method for learning SVM classifiers with \(L_{1}\)-norm penalty ⋮ Combinatorial properties of support vectors of separating hyperplanes ⋮ Frank-Wolfe and friends: a journey into projection-free first-order optimization methods ⋮ A novel Frank-Wolfe algorithm. Analysis and applications to large-scale SVM training ⋮ A theorem on strict separability of convex polyhedra and its applications in optimization ⋮ Finding the nearest point in A polytope ⋮ The distance between two convex sets ⋮ The distance between convex sets with Minkowski sum structure: application to collision detection ⋮ Adaptive conditional gradient method ⋮ Smoothing algorithms for computing the projection onto a Minkowski sum of convex sets ⋮ Finding the closest point to the origin in the convex hull of a discrete set of points ⋮ Unnamed Item ⋮ First-order Methods for the Impatient: Support Identification in Finite Time with Convergent Frank--Wolfe Variants ⋮ An algorithm for solving the minimum-norm point problem over the intersection of a polytope and an affine set ⋮ An approximate algorithm for computing multidimensional convex hulls ⋮ Design of the best linear classifier for box-constrained data sets ⋮ Kernel projection algorithm for large-scale SVM problems. ⋮ The relationship between theorems of the alternative, least norm problems, steepest descent directions, and degeneracy: A review ⋮ Gauss-Seidel method for least-distance problems
This page was built for publication: Finding the Point of a Polyhedron Closest to the Origin
