Related papers: Projecting onto a Capped Rotated Second-Order Cone
Given two arbitrary closed sets in Euclidean space, a simple transversality condition guarantees that the method of alternating projections converges locally, at linear rate, to a point in the intersection. Exact projection onto nonconvex…
We introduce the notion of a Tits arrangement on a convex open cone as a special case of (infinite) simplicial arrangements. Such an object carries a simplicial structure similar to the geometric representation of Coxeter groups. The…
In this note, we highlight some properties of the metric projection onto a closed convex in a Hilbert space. In particular, we use some recent results on fixed points of nonexpansive potential operators.
We derive analytic formulas for the alternating projection method applied to the cone $\mathbb{S}^n_+$ of positive semidefinite matrices and an affine subspace. More precisely, we find recursive relations on parameters representing a…
We study how the supporting hyperplanes produced by the projection process can complement the method of alternating projections and its variants for the convex set intersection problem. For the problem of finding the closest point in the…
A new equivalent reformulation of the absolute value equations associated with second-order cone (SOCAVEs) is emphasised, from which a dynamical system based on projection operator for solving SOCAVEs is constructed. Under proper…
The second-order cone is a class of simple convex cones and optimizing over them can be done more efficiently than with semidefinite programming. It is interesting both in theory and in practice to investigate which convex cones admit a…
We construct examples of two convex bodies $K,L$ in $\mathbb{R}^n$, such that every projection of $K$ onto a $(n-1)$-dimensional subspace can be rotated to be contained in the corresponding projection of $L$, but $K$ itself cannot be…
A closed-form solution for the boundary of the flat state of an orthogonal cross section of contiguous surface geometry formed by the intersection of two cylinders of equal radii oriented in dual directions of rotation about their…
A convex cone is said to be projectionally exposed (p-exposed) if every face arises as a projection of the original cone. It is known that, in dimension at most four, the intersection of two p-exposed cones is again p-exposed. In this paper…
We revisit the problem of computing (robust) controlled invariant sets for discrete-time linear systems. Departing from previous approaches, we consider implicit, rather than explicit, representations for controlled invariant sets.…
The method of alternating projections (MAP) is a common method for solving feasibility problems. While employed traditionally to subspaces or to convex sets, little was known about the behavior of the MAP in the nonconvex case until 2009,…
The classical convex feasibility problem in a finite dimensional Euclidean space is studied in the present paper. We are interested in two cases. First, we assume to know how to compute an exact project onto one of the sets involved and the…
It is possible to solve unbounded convex vector optimization problems (CVOPs) in two phases: (1) computing or approximating the recession cone of the upper image and (2) solving the equivalent bounded CVOP where the ordering cone is…
An irreducible canonical approach to second-order reducible second-class constraints is given. The procedure is exemplified on gauge-fixed three-forms.
It is well-known that the second-order cone can be outer-approximated to an arbitrary accuracy $\epsilon$ by a polyhedral cone of compact size defined by irrational data. In this paper, we propose two rational polyhedral…
We generalize some aspects of the theory of compact projections relative to a C*-algebra, to the setting of more general algebras. Our main result is that compact projections are the decreasing limits of `peak projections', and in the…
This paper presents a convex optimization-based method for finding the globally optimal solutions of a class of mixed-integer non-convex optimal control problems. We consider problems that are non-convex in the input norm, which is a…
A convex optimization problem in conic form involves minimizing a linear functional over the intersection of a convex cone and an affine subspace. In some cases, it is possible to replace a conic formulation using a certain cone, with a…
This article investigates the approximation quality achievable for biobjective minimization problems with respect to the Pareto cone by solutions that are (approximately) optimal with respect to larger ordering cones. When simultaneously…