Related papers: Four Vignettes on Apparent Size
A physical applicability of normed split-algebras, such as hyperbolic numbers, split-quaternions and split-octonions is considered. We argue that the observable geometry can be described by the algebra of split-octonions. In such a picture…
Anomaly detection in large populations is a challenging but highly relevant problem. The problem is essentially a multi-hypothesis problem, with a hypothesis for every division of the systems into normal and anomal systems. The number 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…
We address the problem of solving convex optimization problems with many convex constraints in a distributed setting. Our approach is based on an extension of the alternating direction method of multipliers (ADMM) that recently gained a lot…
We consider the problem of approximating the solution of variational problems subject to the constraint that the admissible functions must be convex. This problem is at the interface between convex analysis, convex optimization, variational…
We study the set of visible lattice points in multidimensional hypercubes. The problems we investigate mix together geometric, probabilistic and number theoretic tones. For example, we prove that almost all self-visible triangles with…
Convergence of a projected stochastic gradient algorithm is demonstrated for convex objective functionals with convex constraint sets in Hilbert spaces. In the convex case, the sequence of iterates ${u_n}$ converges weakly to a point in the…
In this work, we state a general conjecture on the solvability of optimization problems via algorithms with linear convergence guarantees. We make a first step towards examining its correctness by fully characterizing the problems that are…
Metric magnitude is a measure of the "size" of point clouds with many desirable geometric properties. It has been adapted to various mathematical contexts and recent work suggests that it can enhance machine learning and optimization…
Probabilistic submeasures generalizing the classical (numerical) submeasures are introduced and discussed in connection with some classes of aggregation functions. A special attention is paid to triangular norm-based probabilistic…
We compute the minimal angle spread with respect to the uniform distribution in the probability simplex. The resulting optimization problem is analytically solved. The formula provided shows that the minimal angle spread approaches zero as…
Approximations of optimization problems arise in computational procedures and sensitivity analysis. The resulting effect on solutions can be significant, with even small approximations of components of a problem translating into large…
We consider relative or subjective optimization problems where the goal function and feasible set are dependent of the current state of the system under consideration. In general, they are formulated as quasi-equilibrium problems, hence…
Visibility plays an important role for decision making in cluttered, uncertain environments. This paper considers the problem of identifying optimal hiding spots for an agent against line-of-sight detection by an adversary whose location is…
We survey some of the major open problems involving selection principles, diagonalizations, and covering properties in topology and infinite combinatorics. Background details, definitions and motivations are also provided.
We consider various problems related to finding points in $\Q^{2}$ and in $\Q^{3}$ which lie at rational distance from the vertices of some specified geometric object, for example, a square or rectangle in $\Q^{2}$, and a cube or…
We present a 4-approximation algorithm for the problem of placing a fewest guards on a 1.5D terrain so that every point of the terrain is seen by at least one guard. This improves on the currently best approximation factor of 5. Our method…
We consider optimization problems on manifolds with equality and inequality constraints. A large body of work treats constrained optimization in Euclidean spaces. In this work, we consider extensions of existing algorithms from the…
In structured prediction problems where we have indirect supervision of the output, maximum marginal likelihood faces two computational obstacles: non-convexity of the objective and intractability of even a single gradient computation. In…
Some Open Problems Concerning Orthogonal Polynomials.