By A Mystery Man Writer
A cone $K$, where $K ⊆\Bbb R^n$ , is pointed; which means that it contains no line (or equivalently, $(x ∈ K~\land~ −x∈K) ~\to~ x=\vec 0$.
python - How to optimize convex hull drawing? - Stack Overflow
dyadxmachina projects: Constrained Least Squares Problem
Wolfram Optimization: Model, Solve, Analyze Designs
Large-Scale Convex Optimization: Algorithms & Analyses
differential geometry - How to find tangent cone in singular point
Visualizing and defining Convex Sets, by kevkevinpal
Optimization Algorithms: An Overview
Power systems optimization under uncertainty: A review of methods
convex optimization - Finding the inverse image of a function