Related papers: The inverse problem of convex polygon coordinates
Generalized circumcenters have been recently introduced and employed to speed up classical projection-type methods for solving feasibility problems. In this note, circumcenters are enforced in a new setting; they are proven to provide…
This work derives a posteriori error estimate of polygonal finite element methods based on Wachspress barycentric coordinates. In particular, we prove that the classical residual-based a posteriori error estimator is both an upper and lower…
This work presents a unified framework that combines global approximations with locally built models to handle challenging nonconvex and nonsmooth composite optimization problems, including cases involving extended real-valued functions. We…
An important problem in analytic and geometric combinatorics is estimating the number of lattice points in a compact convex set in a Euclidean space. Such estimates have numerous applications throughout mathematics. In this note, we exhibit…
We present a computational methodology for obtaining rotationally symmetric sets of points satisfying discrete geometric constraints, and demonstrate its applicability by discovering new solutions to some well-known problems in…
We study multivariate normal models that are described by linear constraints on the inverse of the covariance matrix. Maximum likelihood estimation for such models leads to the problem of maximizing the determinant function over a…
We prove conditions for the existence of a continuous linear right inverse for a surjective convolution operator in spaces of germs of analytic functions on convex subsets of the complex plane. Considered convex sets have a countable…
We study the computational difficulty of the problem of finding fixed points of nonexpansive mappings in uniformly convex Banach spaces. We show that the fixed point sets of computable nonexpansive self-maps of a nonempty, computably weakly…
Given a compact subset of a Banach space, the Chebyshev center problem consists of finding a minimal circumscribing ball containing the set. In this article we establish a numerically tractable algorithm for solving the Chebyshev center…
We establish a general principle which states that regularizing an inverse problem with a convex function yields solutions which are convex combinations of a small number of atoms. These atoms are identified with the extreme points and…
Consider the problem of finding an optimal value of some objective functional subject to constraints over numerical domain. This type of problem arises frequently in practical engineering tasks. Nowdays almost all general methods for…
This paper presents a geometric approach to the classical isoperimetric problem by analysing the efficiency of regular polygons in enclosing maximum area for a fixed perimeter. Using efficiency metrics, it proves that regular polygons…
Let B be a finite collection of geometric (not necessarily convex) bodies in the plane. Clearly, this class of geometric objects naturally generalizes the class of disks, lines, ellipsoids, and even convex polygons. We consider geometric…
We study the Hopf monoid of convex geometries, which contains partial orders as a Hopf submonoid, and investigate the combinatorial invariants arising from canonical characters. Each invariant consists of a pair: a polynomial and a more…
A geodesic bicombing on a metric space selects for every pair of points a geodesic connecting them. We prove existence and uniqueness results for geodesic bicombings satisfying different convexity conditions. In combination with recent work…
Jigsaw puzzle solving requires the rearrangement of unordered pieces into their original pose in order to reconstruct a coherent whole, often an image, and is known to be an intractable problem. While the possible impact of automatic puzzle…
We show convexity of solutions to a class of convex variational problems in the Gauss and in the Wiener space. An important tool in the proof is a representation formula for integral functionals in this infinite dimensional setting, that…
Representation of convex geometry as an appropriate join of compatible total orderings of the base set can be achieved, when closure operator of convex geometry is algebraic, or finitary. This bears to the finite case proved by P.H.~Edelman…
In [14], B-convexity was defined as an appropriate Painlev\'e-Kuratowski limit of linear convexities. More recently, an alternative algebraic formulation over the entire Euclidean vector space was proposed in [9] and [10]. The issue with…
We define generalized Collatz mappings on free abelian groups of finite rank and study their iteration trajectories. Using geometric arguments we describe cones of points having a divergent trajectory and we deduce lower bounds for the…