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$.
5 Exponential cone optimization — MOSEK Modeling Cookbook 3.3.0
optimization - Variational Inequalities - What excatly does the
Mathematics, Free Full-Text
1706.09423] Separability of diagonal symmetric states: a quadratic
Convex Optimization - MATLAB & Simulink
convex analysis - Basic question about tangent cone - Mathematics
convex optimization - How can I understand the scaled
algorithm - Compute the area of intersection between a circle and
A view of the Milne universe.
optimization - What is the intuitive of the perspective of a
dyadxmachina projects: Constrained Least Squares Problem
Towards Lower Bounds on the Depth of ReLU Neural Networks
Optimization Algorithms for Machine Learning