Related papers: Self-scaled barrier functions on symmetric cones a…
We continue our study, initiated in our earlier paper, of Riemann surfaces with constant curvature and isolated conic singularities. Using the machinery developed in that earlier paper of extended configuration families of simple divisors,…
This paper shows that the self-concordance parameter of the universal barrier on any $n$-dimensional proper convex domain is upper bounded by $n$. This bound is tight and improves the previous $O(n)$ bound by Nesterov and Nemirovski. The…
In 2001, Davies, Gladwell, Leydold, and Stadler proved discrete nodal domain theorems for eigenfunctions of generalized Laplacians, i.e., symmetric matrices with non-positive off-diagonal entries. In this paper, we establish nodal domain…
In this paper, we study relationships between symmetric and non-symmetric separation of (not necessarily convex) cones by using separating cones of Bishop-Phelps type in real normed spaces. Besides extending some known results for the…
We devise a spectral divide-and-conquer scheme for matrices that are self-adjoint with respect to a given indefinite scalar product (i.e. pseudosymmetic matrices). The pseudosymmetric structure of the matrix is preserved in the spectral…
The separation of two sets (or more specific of two cones) plays an important role in different fields of mathematics such as variational analysis, convex analysis, convex geometry, optimization. In the paper, we derive some new results for…
In the finite-dimensional case, we present a new approach to the theory of cones with a mapping cone symmetry, first introduced by St{\o}rmer. Our method is based on a definition of an inner product in the space of linear maps between two…
For the distance function from any closed subset of any complete Finsler manifold, we prove that the singular set is equal to a countable union of delta-convex hypersurfaces up to an exceptional set of codimension two. In addition, in…
Efficient solution of the lowest eigenmodes is studied for a family of related eigenvalue problems with common $2\times 2$ block structure. It is assumed that the upper diagonal block varies between different versions while the lower…
Every polyhedron can be decomposed into a Minkowski sum (or vector sum) of a bounded polyhedron and a polyhedral cone. This paper establishes similar statements for some classes of discrete sets in discrete convex analysis, such as…
We uncover a precise relation between superblocks for correlators of superconformal field theories (SCFTs) in various dimensions and symmetric functions related to the $BC$ root system. The theories we consider are defined by two integers…
Differential geometric approaches to the analysis and processing of data in the form of symmetric positive definite (SPD) matrices have had notable successful applications to numerous fields including computer vision, medical imaging, and…
We consider the nonconvex optimization problem associated with the decomposition of a real symmetric tensor into a sum of rank-one terms. Use is made of the rich symmetry structure to construct infinite families of critical points…
This article derives closed-form parametric formulas for the Minkowski sums of convex bodies in d-dimensional Euclidean space with boundaries that are smooth and have all positive sectional curvatures at every point. Under these conditions,…
Bounded cohomology of groups was first defined by Johnson and Trauber during the seventies in the context of Banach algebras. As an independent and very active research field, however, bounded cohomology started to develop in 1982, thanks…
Scalarization method is an important tool in the study of vector optimization as corresponding solutions of vector optimization problems can be found by solving scalar optimization problems. This is applied by Du (2010) [A note on cone…
In this paper, we address an extension of the theory of self-concordant functions for a manifold. We formulate the self-concordance of a geodesically convex function by a condition of the covariant derivative of its Hessian, and verify that…
It is an open question to determine if the theory of self-concordant barriers can provide an interior point method with strongly polynomial complexity in linear programming. In the special case of the logarithmic barrier, it was shown in…
We extend recent computer-assisted design and analysis techniques for first-order optimization over structured functions--known as performance estimation--to apply to structured sets. We prove "interpolation theorems" for smooth and…
We present an algorithm which produces a decomposition of a regular cellular complex with a discrete Morse function analogous to the Morse-Smale decomposition of a smooth manifold with respect to a smooth Morse function. The advantage of…