Related papers: Calculus of convex polyhedra and polyhedral convex…
Proximal operators with affine constraints arise in numerous models in nonconvex projection, composite optimization, and structured regularization. However, their efficient computation remains challenging due to the simultaneous presence of…
A classification of SL$(n)$ contravariant Minkowski valuations on convex functions and a characterization of the projection body operator are established. The associated LYZ measure is characterized. In addition, a new SL$(n)$ covariant…
We study the projection onto the set of feasible inputs and the set of feasible solutions of a polynomial optimisation problem (POP). Our motivation is increasing the robustness of solvers for POP: Without a priori guarantees of feasibility…
Two new optimization techniques based on projections onto convex space (POCS) framework for solving convex and some non-convex optimization problems are presented. The dimension of the minimization problem is lifted by one and sets…
We study two notions. One is that of spindle convexity. A set of circumradius not greater than one is spindle convex if, for any pair of its points, it contains every short circular arc of radius at least one, connecting them. The other…
In this paper, we introduce operator geodesically convex and operator convex-log functions and characterize some properties of them. Then apply these classes of functions to present several operator Azc\'{e}l and Minkowski type inequalities…
It is shown how the Beneath-and-Beyond algorithm can be used to yield another proof of the equivalence of V- and H-representations of convex polytopes. In this sense this paper serves as the sketch of an introduction to polytope theory with…
We investigate the folding problem that asks if a polygon P can be folded to a polyhedron Q for given P and Q. Recently, an efficient algorithm for this problem has been developed when Q is a box. We extend this idea to regular polyhedra,…
We study the mixed-integer epigraph of a special class of convex functions with non-convex indicator constraints, which are often used to impose logical constraints on the support of the solutions. The class of functions we consider are…
Computing a polygon defining a set of planar points is a classical problem of modern computational geometry. In laboratory experiments we demonstrate that a concave hull, a connected alpha-shape without holes, of a finite planar set is…
Knowing the symmetries of a polyhedron can be very useful for the analysis of its structure as well as for practical polyhedral computations. In this note, we study symmetry groups preserving the linear, projective and combinatorial…
This is a pdf print of the homonymous Maple file, freely available at http://www.maplesoft.com/applications/view.aspx?SID=127621, providing procedures which are able to produce the toric data associated with a (polarized) weighted…
OneLOop is a program to evaluate the one-loop scalar 1-point, 2-point, 3-point and 4-point functions, for all kinematical configurations relevant for collider-physics, and for any non-positive imaginary parts of the internal squared masses.…
We propose in this paper a general framework for deriving loss functions for structured prediction. In our framework, the user chooses a convex set including the output space and provides an oracle for projecting onto that set. Given that…
In this paper, we investigate the concept of p-convexity for sets and functions in n-dimensional Euclidean space. We establish novel algebraic and topological results within this generalized convexity framework. Furthermore, we analyze…
The convex hull is a fundamental geometrical structure for many applications where groups of points must be enclosed or represented by a convex polygon. Although efficient sequential convex hull algorithms exist, and are constantly being…
In multicentric holomorphic calculus one represents the function $\varphi$ using a new polynomial variable $w=p(z)$ in such a way that when it is evaluated at the operator $A,$ then $p(A)$ is small in norm. Usually it is assumed that $p$…
Given an Euclidean space, this paper elucidates the topological link between the partial derivatives of the Minkowski functional associated to a set (assumed to be compact, convex, with a differentiable boundary and a non-empty interior)…
This paper presents an alternate choice of computing the convex hulls (CHs) for planar point sets. We firstly discard the interior points and then sort the remaining vertices by x- / y- coordinates separately, and later create a group…
Convexification based on convex envelopes is ubiquitous in the non-linear optimization literature. Thanks to considerable efforts of the optimization community for decades, we are able to compute the convex envelopes of a considerable…