The distance between two convex sets

DOI10.1016/j.laa.2006.03.022zbMath1131.90031MaRDI QIDQ2497250

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

zbMATH Keywords

theorems of the alternatives; steepest descent directions; inconsistent systems of linear inequalities; a new minimum norm duality theorem; constructive optimality conditions; linear least norm problems; the distance between two convex polytopes; the distance between two ellipsoids; the double role of duality in least norm problems; the polar decomposition of the least deviation problem

Mathematics Subject Classification ID

90C46: Optimality conditions and duality in mathematical programming

90C08: Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.)

52A20: Convex sets in (n) dimensions (including convex hypersurfaces)

Related Items

Kinematics for unilateral constraints in multibody dynamics, Generalized projections onto convex sets, Gate points in continuous location between regions with different \(\ell _{p}\) norms, Methods and algorithms to test the Hausdorff and simplex dispersion orders with an R package, Support vector machines for classification of input vectors with different metrics, A hybrid algorithm for solving linear inequalities in a least squares sense, The distance between convex sets with Minkowski sum structure: application to collision detection, The obstacle avoidance motion planning problem for autonomous vehicles: a low-demanding receding horizon control scheme, Almost common priors, Generalized isotone projection cones, Support and separation properties of convex sets in finite dimension

Cites Work

• A new theorem of the alternative
• The \(\ell_1\) solution of linear inequalities
• A computational solution of the inverse problem in radiation-therapy treatment planning
• Linear programming via least squares
• Smallest point of a polytope
• New methods for linear inequalities
• Arbitrary-norm separating plane
• The relationship between theorems of the alternative, least norm problems, steepest descent directions, and degeneracy: A review
• On minimum norm solutions
• The fundamental theorem of game theory revisited
• Theorems of the alternative and duality
• Minimum distance to the complement of a convex set: Duality result
• Least squares methods to minimize errors in a smooth, strictly convex norm on \({\mathbb{R}}^ m\)
• Least-squares algorithms for finding solutions of overdetermined systems of linear equations which minimize error in a smooth strictly convex norm
• The smallest correction of an inconsistent system of linear inequalities
• Duality for nonconvex approximation and optimization.
• Least squares algorithms for finding solutions of overdetermined linear equations which minimize error in an abstract norm
• An approach to nonlinear programming
• Lectures on Modern Convex Optimization
• Loss and retention of accuracy in affine scaling methods
• On generalized Hölder inequality
• Computer-Intensive Methods in Statistical Regression
• Extensions of Hildreth’s Row-Action Method for Quadratic Programming
• Finding the nearest point in A polytope
• Mathematical Programming in Neural Networks
• Finding the Point of a Polyhedron Closest to the Origin
• Another Proof that Convex Functions are Locally Lipschitz
• Linear and Nonlinear Separation of Patterns by Linear Programming
• Applications of the Hahn-Banach Theorem in Approximation Theory
• Best approximation in inner product spaces
• Minimum \(L_1\)-distance projection onto the boundary of a convex set: simple characterization
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item