The distance between two convex sets
DOI10.1016/J.LAA.2006.03.022zbMATH Open1131.90031OpenAlexW2083014673MaRDI QIDQ2497250FDOQ2497250
Authors: Achiya Dax 
Publication date: 4 August 2006
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.laa.2006.03.022
Recommendations
theorems of the alternativessteepest descent directionsinconsistent systems of linear inequalitiesa new minimum norm duality theoremconstructive optimality conditionslinear least norm problemsthe distance between two convex polytopesthe distance between two ellipsoidsthe double role of duality in least norm problemsthe polar decomposition of the least deviation problem
Optimality conditions and duality in mathematical programming (90C46) Convex sets in (n) dimensions (including convex hypersurfaces) (52A20) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08)
Cites Work
- Title not available (Why is that?)
- Lectures on modern convex optimization. Analysis, algorithms, and engineering applications
- Smallest point of a polytope
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Best approximation in inner product spaces
- Title not available (Why is that?)
- Linear and Nonlinear Separation of Patterns by Linear Programming
- An approach to nonlinear programming
- Finding the nearest point in A polytope
- Finding the Point of a Polyhedron Closest to the Origin
- Another Proof that Convex Functions are Locally Lipschitz
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Theorems of the alternative and duality
- Arbitrary-norm separating plane
- New methods for linear inequalities
- Title not available (Why is that?)
- A computational solution of the inverse problem in radiation-therapy treatment planning
- Title not available (Why is that?)
- The smallest correction of an inconsistent system of linear inequalities
- On generalized Hölder inequality
- A new theorem of the alternative
- Duality for nonconvex approximation and optimization.
- Applications of the Hahn-Banach Theorem in Approximation Theory
- Mathematical Programming in Neural Networks
- Least squares methods to minimize errors in a smooth, strictly convex norm on \({\mathbb{R}}^ m\)
- Computer-Intensive Methods in Statistical Regression
- Extensions of Hildreth’s Row-Action Method for Quadratic Programming
- Linear programming via least squares
- The fundamental theorem of game theory revisited
- Title not available (Why is that?)
- Minimum distance to the complement of a convex set: Duality result
- The relationship between theorems of the alternative, least norm problems, steepest descent directions, and degeneracy: A review
- Loss and retention of accuracy in affine scaling methods
- The \(\ell_1\) solution of linear inequalities
- Least-squares algorithms for finding solutions of overdetermined systems of linear equations which minimize error in a smooth strictly convex norm
- Title not available (Why is that?)
- Least squares algorithms for finding solutions of overdetermined linear equations which minimize error in an abstract norm
- On minimum norm solutions
- Minimum \(L_1\)-distance projection onto the boundary of a convex set: simple characterization
Cited In (20)
- Distance sets corresponding to convex bodies
- A hybrid algorithm for solving linear inequalities in a least squares sense
- Bounded arbitrage and nearly rational behavior
- Generalized projections onto convex sets
- The distance between convex sets with Minkowski sum structure: application to collision detection
- Gate points in continuous location between regions with different \(\ell _{p}\) norms
- Almost common priors
- Quasi-support hyperplanes in asymmetric normed spaces
- Title not available (Why is that?)
- Support vector machines for classification of input vectors with different metrics
- The obstacle avoidance motion planning problem for autonomous vehicles: a low-demanding receding horizon control scheme
- Kinematics for unilateral constraints in multibody dynamics
- Title not available (Why is that?)
- Support and separation properties of convex sets in finite dimension
- Methods and algorithms to test the Hausdorff and simplex dispersion orders with an R package
- Generalized isotone projection cones
- Minimal distance between two non-convex surfaces
- A New Class of Minimum Norm Duality Theorems
- Title not available (Why is that?)
- Distance between strongly and weakly convex sets
This page was built for publication: The distance between two convex sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2497250)
