The distance between two convex sets
From MaRDI portal
Publication:2497250
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
Recommendations
Cites work
- scientific article; zbMATH DE number 439380 (Why is no real title available?)
- scientific article; zbMATH DE number 3852235 (Why is no real title available?)
- scientific article; zbMATH DE number 3856876 (Why is no real title available?)
- scientific article; zbMATH DE number 4200003 (Why is no real title available?)
- scientific article; zbMATH DE number 3915531 (Why is no real title available?)
- scientific article; zbMATH DE number 3177945 (Why is no real title available?)
- scientific article; zbMATH DE number 3561096 (Why is no real title available?)
- scientific article; zbMATH DE number 1215249 (Why is no real title available?)
- scientific article; zbMATH DE number 1324221 (Why is no real title available?)
- scientific article; zbMATH DE number 1745905 (Why is no real title available?)
- scientific article; zbMATH DE number 194432 (Why is no real title available?)
- scientific article; zbMATH DE number 1382772 (Why is no real title available?)
- scientific article; zbMATH DE number 3257775 (Why is no real title available?)
- scientific article; zbMATH DE number 3281211 (Why is no real title available?)
- scientific article; zbMATH DE number 3298088 (Why is no real title available?)
- scientific article; zbMATH DE number 3308846 (Why is no real title available?)
- scientific article; zbMATH DE number 3323651 (Why is no real title available?)
- scientific article; zbMATH DE number 3365044 (Why is no real title available?)
- A computational solution of the inverse problem in radiation-therapy treatment planning
- A new theorem of the alternative
- An approach to nonlinear programming
- Another Proof that Convex Functions are Locally Lipschitz
- Applications of the Hahn-Banach Theorem in Approximation Theory
- Arbitrary-norm separating plane
- Best approximation in inner product spaces
- Computer-Intensive Methods in Statistical Regression
- Duality for nonconvex approximation and optimization.
- Extensions of Hildreth’s Row-Action Method for Quadratic Programming
- Finding the Point of a Polyhedron Closest to the Origin
- Finding the nearest point in A polytope
- Least squares algorithms for finding solutions of overdetermined linear equations which minimize error in an abstract norm
- 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
- Lectures on modern convex optimization. Analysis, algorithms, and engineering applications
- Linear and Nonlinear Separation of Patterns by Linear Programming
- Linear programming via least squares
- Loss and retention of accuracy in affine scaling methods
- Mathematical Programming in Neural Networks
- Minimum \(L_1\)-distance projection onto the boundary of a convex set: simple characterization
- Minimum distance to the complement of a convex set: Duality result
- New methods for linear inequalities
- On generalized Hölder inequality
- On minimum norm solutions
- Smallest point of a polytope
- The _1 solution of linear inequalities
- The fundamental theorem of game theory revisited
- The relationship between theorems of the alternative, least norm problems, steepest descent directions, and degeneracy: A review
- The smallest correction of an inconsistent system of linear inequalities
- Theorems of the alternative and duality
Cited in
(20)- scientific article; zbMATH DE number 1369462 (Why is no real title available?)
- Distance between strongly and weakly convex sets
- Distance sets corresponding to convex bodies
- A hybrid algorithm for solving linear inequalities in a least squares sense
- Generalized projections onto convex sets
- Bounded arbitrage and nearly rational behavior
- 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
- scientific article; zbMATH DE number 3950241 (Why is no real title available?)
- 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
- Methods and algorithms to test the Hausdorff and simplex dispersion orders with an R package
- Kinematics for unilateral constraints in multibody dynamics
- Support and separation properties of convex sets in finite dimension
- scientific article; zbMATH DE number 7618005 (Why is no real title available?)
- Generalized isotone projection cones
- Minimal distance between two non-convex surfaces
- A New Class of Minimum Norm Duality Theorems
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)
