Related papers: Singularity degree of non-facially exposed faces
The singularity degree of a semidefinite programming problem is the smallest number of facial reduction steps to make the problem strictly feasible. We introduce two new graph parameters, called the singularity degree and the nondegenerate…
We consider the projected semi-definite and Euclidean distance cones onto a subset of the matrix entries. These two sets are precisely the input data defining feasible semi-definite and Euclidean distance completion problems. We classify…
A spectrahedron is the feasible set of a semidefinite program, SDP, i.e., the intersection of an affine set with the positive semidefinite cone. While strict feasibility is a generic property for random problems, there are many classes of…
We completely classify all plane curves of degree at most 30 with a unique cuspidal (locally unibranch) singular point and rational normalization in terms of the Newton pairs parameterizing the cusp. We distinguish between prime and…
Let $Z$ be a projective hypersurface such that its underlying reduced variety has only isolated singularities. In case its irreducible components have constant multiplicities, for instance if $\dim Z>1$, we show that the spectrum of its…
A convex cone $\mathcal{K}$ is said to be homogeneous if its group of automorphisms acts transitively on its relative interior. Important examples of homogeneous cones include symmetric cones and cones of positive semidefinite (PSD)…
We consider singularities of frontal surfaces of corank one and finite frontal codimension. We look at the classification under left-right-equivalence and introduce the notion of frontalisation for singularities of fold type. We define the…
We provide a framework for obtaining error bounds for linear conic problems without assuming constraint qualifications or regularity conditions. The key aspects of our approach are the notions of amenable cones and facial residual…
Given any finite set of nonnegative integers, there exists a closed convex set whose facial dimension signature coincides with this set of integers, that is, the dimensions of its nonempty faces comprise exactly this set of integers. In…
This paper concerns the facial geometry of the set of $n \times n$ correlation matrices. The main result states that almost every set of $r$ vertices generates a simplicial face, provided that $r \leq \sqrt{\mathrm{c} n}$, where…
Let $X$ be a simplicial complex with $n$ vertices. A missing face of $X$ is a simplex $\sigma\notin X$ such that $\tau\in X$ for any $\tau\subsetneq \sigma$. For a $k$-dimensional simplex $\sigma$ in $X$, its degree in $X$ is the number of…
Reconstructing the detailed geometric structure of a face from a given image is a key to many computer vision and graphics applications, such as motion capture and reenactment. The reconstruction task is challenging as human faces vary…
We discuss a weak constraint qualification for conic linear programs and its applications for a few classes of cones. This constraint qualification is used to give a solution to a problem proposed by Shapiro and Z\v{a}linescu and show that…
We present FRA-Poly, a facial reduction algorithm (FRA) for conic linear programs that is sensitive to the presence of polyhedral faces in the cone. The main goals of FRA and FRA-Poly are the same, i.e., finding the minimal face containing…
In a previous paper [R. Andreani, G. Haeser, L. M. Mito, H. Ram\'irez, T. P. Silveira. First- and second-order optimality conditions for second-order cone and semidefinite programming under a constant rank condition. Mathematical…
The structure of maximal faces of the cone of completely positive matrices is still not well understood in higher dimensions, mainly due to the lack of a general characterization of extreme exposed rays of the copositive cone beyond small…
We study singularities and geometric properties of surfaces given by the singular loci of normal congruence of frontals with pure-frontal singular points. These surfaces consist of the normal ruled surface and focal surfaces of the initial…
Until now, the only known maximal surfaces in Minkowski 3-space of finite topology with compact singular set and without branch points were either genus zero or genus one, or came from a correspondence with minimal surfaces in Euclidean…
We classify the faces of copositive and completely positive cones over a second-order cone and investigate their dimension and exposedness properties. Then we compute two parameters related to chains of faces of both cones. At the end, we…
Let $\mathcal{F}$ be a plane singular curve defined over a finite field $\mathbb{F}_q$. The linear system of plane curves of a given degree passing through the singularities of $\cF$ provides potentially good bounds for the number of points…