Smallest point of a polytope

DOI10.1007/BF00939458zbMath0666.90031MaRDI QIDQ1117135

Achiya Dax

Publication date: 1990

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

zbMATH Keywords

convex hulllinear least-squares problemfacility locationlarge sparse problemsactive set methodrow relaxationleast-distance problempoint of smallest Euclidean norm

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Inventory, storage, reservoirs (90B05) Inequalities and extremum problems involving convexity in convex geometry (52A40) Convex sets in (n) dimensions (including convex hypersurfaces) (52A20) Polytopes and polyhedra (52Bxx)

Related Items (10)

Minimum quadratic distance density estimation using nonparametric mixtures ⋮ Modelling of count data using nonparametric mixtures ⋮ Least squares estimation of a \(k\)-monotone density function ⋮ A mixture model-based nonparametric approach to estimating a count distribution ⋮ A nonparametric mixture approach to density and null proportion estimation in large‐scale multiple comparison problems ⋮ Fisher scoring: an interpolation family and its Monte Carlo implementations ⋮ The distance between two convex sets ⋮ Density estimation using non-parametric and semi-parametric mixtures ⋮ Nonparametric multivariate density estimation using mixtures ⋮ Efficient computation of nonparametric survival functions via a hierarchical mixture formulation

Cites Work

• Unnamed Item
• Successive Refinement of Large Multicell Models
• Extensions of Hildreth’s Row-Action Method for Quadratic Programming
• Row-Action Methods for Huge and Sparse Systems and Their Applications
• Finding the nearest point in A polytope
• Finding the Point of a Polyhedron Closest to the Origin
• A note on optimality conditions for the Euclidean. Multifacility location problem

This page was built for publication: Smallest point of a polytope