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$.
imgv2-2-f.scribdassets.com/img/document/683119072/
Wolfram Optimization: Model, Solve, Analyze Designs
Linear and Integer Optimization: Theory and Practice, Third
algorithm - Compute the area of intersection between a circle and
Wolfram Optimization: Model, Solve, Analyze Designs
ENTRY ARTIFICIAL INTELLIGENCE - Department of Mathematics
Convex Cones: Building Blocks of Convexity - FasterCapital
Power systems optimization under uncertainty: A review of methods
Towards Lower Bounds on the Depth of ReLU Neural Networks
Convex cone - Wikipedia