相关论文: Facially Dual Complete (Nice) cones and lexicograp…
Optimizing an implicational base of a closure system consists in turning this implicational base into an equivalent one with premises and conclusions as small as possible. This task is known to be hard in general but tractable for a number…
Tensor products of convex cones have recently come up in different areas, ranging from functional analysis and operator theory to approximation theory and theoretical physics. However, most of the existing literature focuses either on…
We introduce lexicographic cones, a method of assigning an ordered vector space $\Lex(S)$ to a poset $S$, generalising the standard lexicographic cone. These lexicographic cones are then used to prove that the projective tensor cone of two…
A convex cone is homogeneous if its automorphism group acts transitively on the interior of the cone, i.e., for every pair of points in the interior of the cone, there exists a cone automorphism that maps one point to the other. Cones that…
While faces of a polytope form a well structured lattice, in which faces of each possible dimension are present, this is not true for general compact convex sets. We address the question of what dimensional patterns are possible for the…
The faces of a convex set owe their relevance to an interplay between convexity and topology that is systematically studied in the work of Rockafellar. Infinite-dimensional convex sets are excluded from this theory as their relative…
Convex geometries form a subclass of closure systems with unique criticals, or $UC$-systems. We show that the $F$-basis introduced in [1] for $UC$-systems, becomes optimum in convex geometries, in two essential parts of the basis: right…
The cone of nonnegative polynomials is of fundamental importance in real algebraic geometry, but its facial structure is understood in very few cases. We initiate a systematic study of the facial structure of the cone of nonnegative…
We address the conjecture proposed by Gabor Pataki that every facially exposed cone is nice. We show that the conjecture is true in the three-dimensional case, however, there exists a four-dimensional counterexample of a cone that is…
In a previous paper, published in 1992, a primal conical LP algorithm with exact finite coonvergence was presented. The underlying optimality condition requires tangency of two sets (an affine space and a cone). In the algorithm the two…
Hyperbolic polynomials elegantly encode a rich class of convex cones that includes polyhedral and spectrahedral cones. Hyperbolic polynomials are closed under taking polars and the corresponding cones, the derivative cones, yield…
Soft-thresholding has been widely used in neural networks. Its basic network structure is a two-layer convolution neural network with soft-thresholding. Due to the network's nature of nonlinearity and nonconvexity, the training process…
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 associate with each convex optimization problem, posed on some locally convex space, with infinitely many constraints indexed by the set T, and a given non-empty family H of finite subsets of T, a suitable Lagrangian-Haar dual problem.…
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…
In the paper we consider convex cones in infinite-dimensional real vector spaces which are endowed with no topology. The main purpose is to study an internal geometric structure of convex cones and to obtain an analytical description of…
In this paper, we study the facial structure of the linear image of a cone. We define the singularity degree of a face of a cone to be the minimum number of steps it takes to expose it using exposing vectors from the dual cone. We show that…
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…
We introduce an extended tangent cone of high order to a set and study its properties. Then we use this local approximation for deriving high-order necessary conditions for local minimizers of constrained optimization problems.
We derive a closed-form expression for the projection onto a capped rotated second-order cone -- a convex set that arises in perspective relaxations of nonlinear programs with binary indicator variables. The closed-form solution involves…