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$.
Peter Richtarik
optimization - Variational Inequalities - What excatly does the
convex analysis - Basic question about tangent cone - Mathematics
Wolfram Optimization: Model, Solve, Analyze Designs
What is the intuitive explanation for the duality in optimization? Why
1706.09423] Separability of diagonal symmetric states: a quadratic
LearnOpenGL - Frustum Culling
algorithm - Compute the area of intersection between a circle and
A tree search algorithm towards solving Ising formulated
Inverse Optimization: Theory and Applications
Convex Cones: Building Blocks of Convexity - FasterCapital
Mathematics, Free Full-Text
Convex cone - Wikipedia
PDF) Newton-Raphson Consensus for Distributed Convex Optimization
Convex Optimization I Course I Stanford Online