Mathematics of Operations Research, Vol. 42, No. 1 (February 2017), pp. 57-76 (20 pages) The l₀-minimization problem that seeks the sparsest point of a polyhedral set is a long-standing, challenging ...
We show that the boundary of an n-dimensional closed convex set B ⊂ ℝⁿ, possibly unbounded, is a convex quadric surface if and only if the middle points of every family of parallel chords of B lie in ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback