Finding the Point of a Polyhedron Closest to the Origin

Cited In (39)

An analytical solution to the minimum \(L_ p\)-norm of a hyperplane
Adaptive conditional gradient method
Smallest point of a polytope
The problem of projecting the origin of Euclidean space onto the convex polyhedron
Gauss-Seidel method for least-distance problems
A Method for Minimization of Quasidifferentiable Functions
An approximate algorithm for computing multidimensional convex hulls
An effective method to determine whether a point is within a convex hull and its generalized convex polyhedron classifier
The relationship between theorems of the alternative, least norm problems, steepest descent directions, and degeneracy: A review
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 algorithm for solving the minimum-norm point problem over the intersection of a polytope and an affine set
An iterative algorithm learning the maximal margin classifier.
Kernel projection algorithm for large-scale SVM problems.
A trust region method for solving linearly constrained locally Lipschitz optimization problems
The distance between convex sets with Minkowski sum structure: application to collision detection
On the MDM method for solving the general quadratic problem of mathematical diagnostics
An efficient algorithm for finding the minimum norm point in the convex hull of a finite point set in the plane
Smoothing algorithms for computing the projection onto a Minkowski sum of convex sets
First-order Methods for the Impatient: Support Identification in Finite Time with Convergent Frank--Wolfe Variants
An effective nonsmooth optimization algorithm for locally Lipschitz functions
Clipping algorithms for solving the nearest point problem over reduced convex hulls
SVM via saddle point optimization: new bounds and distributed algorithms
A novel Frank-Wolfe algorithm. Analysis and applications to large-scale SVM training
Linear convergence rate for the MDM algorithm for the nearest point problem
A framework for co-optimization algorithm performance and its application to worst-case optimization
The distance between two convex sets
Finding the closest point to the origin in the convex hull of a discrete set of points
Combinatorial properties of support vectors of separating hyperplanes
Selective bi-coordinate method for limit non-smooth resource allocation type problems
A theorem on strict separability of convex polyhedra and its applications in optimization
\(L_{1}\)-norm loss based twin support vector machine for data recognition
Frank-Wolfe and friends: a journey into projection-free first-order optimization methods
A maximum \(L_p\) distance problem
Design of the best linear classifier for box-constrained data sets
Riemannian optimization via Frank-Wolfe methods
A general soft method for learning SVM classifiers with \(L_{1}\)-norm penalty
Review of works by V. A. Yakubovich's scientific school on artificial intelligence and robotics
Finding the nearest point in A polytope

This page was built for publication: Finding the Point of a Polyhedron Closest to the Origin

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4403397)