相关论文: Minimal time functions and the smallest intersecti…
We study shortest paths and their distances on a subset of a Euclidean space, and their approximation by their equivalents in a neighborhood graph defined on a sample from that subset. In particular, we recover and extend the results of…
Minimax optimization has been central in addressing various applications in machine learning, game theory, and control theory. Prior literature has thus far mainly focused on studying such problems in the continuous domain, e.g.,…
Monotonicity formulae play a crucial role for many geometric PDEs, especially for their regularity theories. For minimal submanifolds in a Euclidean ball, the classical monotonicity formula implies that if such a submanifold passes through…
The problem of finding the minimizer of a sum of convex functions is central to the field of optimization. Thus, it is of interest to understand how that minimizer is related to the properties of the individual functions in the sum. In this…
We consider volume-constrained minimizers of the fractional perimeter with the addition of a potential energy in the form of a volume inte- gral. Such minimizers are solutions of the prescribed fractional curvature problem. We prove…
In 1960s, Almgren initiated a program to find minimal hypersurfaces in compact manifolds using min-max method. This program was largely advanced by Pitts and Schoen-Simon in 1980s when the manifold has no boundary. In this paper, we finish…
We study the minimum diameter problem for a set of inexact points. By inexact, we mean that the precise location of the points is not known. Instead, the location of each point is restricted to a contineus region ($\impre$ model) or a…
In this survey, we discuss volumetric and combinatorial results concerning (mostly finite) intersections or unions of balls (mostly of equal radii) in the $d$-dimensional real vector space, mostly equipped with the Euclidean norm. Our first…
We consider the problem of minimizing a polynomial function over the integer lattice. Though impossible in general, we use a known sufficient condition for the existence of continuous minimizers to guarantee the existence of integer…
We derive information-theoretic converses (i.e., lower bounds) for the minimum time required by any algorithm for distributed function computation over a network of point-to-point channels with finite capacity, where each node of the…
We consider the problem of minimizing a sum of non-convex functions over a compact domain, subject to linear inequality and equality constraints. Approximate solutions can be found by solving a convexified version of the problem, in which…
The problem of finding "small" sets that meet every straight-line which intersects a given convex region was initiated by Mazurkiewicz in 1916. We call such a set an {\em opaque set} or a {\em barrier} for that region. We consider the…
The primary objective of this paper is to establish the Ahlfors regularity of minimizers of set functions that satisfy a suitable maxitive condition on disjoint unions of sets. Our analysis focuses on minimizers within continua of the plane…
This paper proposes a method to compute lower performance bounds for discrete-time infinite-horizon min-max control problems with input constraints and bounded disturbances. Such bounds can be used as a performance metric for control…
The minimum-time control problem consists in finding a control policy that will drive a given dynamic system from a given initial state to a given target state (or a set of states) as quickly as possible. This is a well-known challenging…
For the classical N-body problem, an approach is proposed based on the introduction of some natural in the physical sense optimization problems of mathematical programming for finding a conditional minimum for the characteristics of the…
In this paper we study the area minimizing problem in some kinds of conformal cones. This concept is a generalization of the cones in Eulcidean spaces and the cylinders in product manifolds. We define a non-closed-minimal (NCM) condition…
We study the dynamics of iteration function systems generated by a pair of circle diffeomorphisms close to rotations in the $C^{1+\mathrm{bv}}$-topology. We characterize the obstruction to minimality and describe the limit set. In…
We investigate the intersections of balls of radius $r$, called $r$-ball bodies, in Euclidean $d$-space. An $r$-lense (resp., $r$-spindle) is the intersection of two balls of radius $r$ (resp., balls of radius $r$ containing a given pair of…
G. Fejes T\'oth posed the following problem: Determine the infimum of the densities of the lattices of closed balls in $\bR^n$ such that each affine $k$-subspace $(0 \le k \le n-1)$ of $\bR^n$ intersects some ball of the lattice. We give a…