相关论文: The Homogenization Cone: Polar Cone and Projection
We study the metric projection onto the closed convex cone in a real Hilbert space $\mathscr{H}$ generated by a sequence $\mathcal{V} = \{v_n\}_{n=0}^\infty$. The first main result of this paper provides a sufficient condition under which…
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…
There exist efficient algorithms to project a point onto the intersection of a convex cone and an affine subspace. Those conic projections are in turn the work-horse of a range of algorithms in conic optimization, having a variety of…
Consider a polyhedral convex cone which is given by a finite number of linear inequalities. We investigate the problem to project this cone into a subspace and show that this problem is closely related to linear vector optimization: We…
Let Z be an algebraic homogeneous space Z=G/H attached to real reductive Lie group G. We assume that Z is real spherical, i.e., minimal parabolic subgroups have open orbits on Z. For such spaces we investigate their large scale geometry and…
The basic tool for solving problems in metric geometry and isotonic regression is the metric projection onto closed convex cones. Isotonicity of these projections with respect to a given order relation can facilitate finding the solutions…
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)…
In the first part of this article, we study linear cones over totally ordered fields. We show that for each such cone there uniquely exists a universal vector space (called its spanned vector space) into which it embeds as a generating…
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…
Let $R$ be the homogeneous coordinate ring of a smooth projective variety $X$ over a field $\k$ of characteristic~0. We calculate the $K$-theory of $R$ in terms of the geometry of the projective embedding of $X$. In particular, if $X$ is a…
The projection onto the intersection of sets generally does not allow for a closed form even when the individual projection operators have explicit descriptions. In this work, we systematically analyze the projection onto the intersection…
In this paper we extend the notion of a Lorentz cone. We call a closed convex set isotone projection set with respect to a pointed closed convex cone if the projection onto the set is isotone (i.e., monotone) with respect to the order…
This article focuses on numerical efficiency of projection algorithms for solving linear optimization problems. The theoretical foundation for this approach is provided by the basic result that bounded finite dimensional linear optimization…
We fully characterize orthogonal projections of infinite right circular (round) cones in real Hilbert spaces. Another interpretation is that, given two vectors in a real Hilbert space, we establish the optimal estimate on the angle between…
This work addresses arbitrary convex vector optimization problems, which constitute a general framework for multi-criteria decision-making in diverse real-world applications. Due to their complexity, such problems are typically tackled…
A theorem of Moreau (1962) states that given a closed convex cone $C$ and its (negative) polar cone $C^\circ$ in a real Hilbert space $H$, vectors $y \in C$ and $z \in C^\circ$ are metric projections of a vector $u \in H$ on $C$ and…
If $K$ and $L$ are mutually dual closed convex cones in a Hilbert space with the metric projections onto them denoted by $P_K$ and $P_L$ respectively, then the following two assertions are equivalent: (i) $P_K$ is isotone with respect to…
In the study of polarized light, there are two basic notions: the Stokes vectors and the matrices which preserve them, called Mueller matrices. The set of Stokes vectors forms a cone: the Future Light Cone. In this work we will see that the…
For a given polyhedral convex set-valued mapping we define a polyhedral convex cone which we call the natural ordering cone. We show that the solution behavior of a polyhedral convex set optimization problem can be characterized by this…
Parallel and cyclic projection algorithms are proposed for minimizing the sum of a finite family of convex functions over the intersection of a finite family of closed convex subsets of a Hilbert space. These algorithms are of…