相关论文: Minimal time functions and the smallest intersecti…
We consider the problem of placing n small balls of given radius in a certain domain subject to a force f in order to minimize the compliance of the configuration. Then we let n tend to infinity and look at the asymptotics of the…
Given a set of $n$ points in the plane, and a parameter $k$, we consider the problem of computing the minimum (perimeter or area) axis-aligned rectangle enclosing $k$ points. We present the first near quadratic time algorithm for this…
We prove that every plane passing through the origin divides an embedded compact free boundary minimal surface of the euclidean $3$-ball in exactly two connected surfaces. We also show that if a region in the ball has mean convex boundary…
In the first part of this paper we introduced an algorithm that uses reachable set approximation to approximate the minimum time function of linear control problems. To illustrate the error estimates and to demonstrate differences to other…
This paper establishes three minimax theorems for possibly nonconvex functions on Euclidean spaces or on infinite-dimensional Hilbert spaces. The theorems also guarantee the existence of saddle points. As a by-product, a complete solution…
The paper is devoted to introducing an approach to compute the approximate minimum time function of control problems which is based on reachable set approximation and uses arithmetic operations for convex compact sets. In particular, in…
Algorithms for minimal enclosing ball problems are often geometric in nature. To highlight the metric ingredients underlying their efficiency, we focus here on a particularly simple geodesic-based method. A recent subgradient-based study…
The aim of this paper is to present an original approach that takes advantage from the geometric features of strictly convex functions to tackle the problem of finding the minimum from another perspective. The general idea is that near the…
In this paper we analyze the extension of the classical smallest enclosing disk problem to the case of the location of a polyellipsoid to fully cover a set of demand points in $\mathbb{R}^d$. We prove that the problem is polynomially…
For the well-known model of a system of N particles with interaction (N-body problem), we consider the spatial problem of finding the minimum of the function of the kinetic energy of a system on its phase space under conditions on its size…
We study the min-max optimization problem where each function contributing to the max operation is strongly-convex and smooth with bounded gradient in the search domain. By smoothing the max operator, we show the ability to achieve an…
We provide a unified framework for a systematic analysis of the existence of solutions to general nonconvex problems, relying on asymptotic and retractive cones for functions and sets. Using this framework we develop new necessary and…
In this paper, we introduce two iterative methods for longest minimal length partition problem, which asks whether the disc (ball) is the set maximizing the total perimeter of the shortest partition that divides the total region into…
In this paper, we discuss the role of the shortest distance in time-dependent enclosure method for the inverse problems when the inclusions are embedded in a non-layered or two-layered medium. Furthermore, the regularity assumptions for the…
It has recently been established byWang and Xia [WX] that local minimizers of perimeter within a ball subject to a volume constraint must be spherical caps or planes through the origin. This verifies a conjecture of the authors and is in…
Our contribution in this paper is two folded. We consider first the case of linear programming with real coefficients and give a method which allows the computation of a new upper bound on the distance from the origin to a feasible point.…
In this paper, we revisit the Minimum Enclosing Ball (MEB) problem and its robust version, MEB with outliers, in Euclidean space $\mathbb{R}^d$. Though the problem has been extensively studied before, most of the existing algorithms need at…
Networked discrete dynamical systems are often used to model the spread of contagions and decision-making by agents in coordination games. Fixed points of such dynamical systems represent configurations to which the system converges. In the…
The enclosure method was originally introduced for inverse problems of concerning non-destructive evaluation governed by elliptic equations. It was developed as one of useful approaches in inverse problems and applied for various equations.…
This paper concerns the minimax center of a collection of linear subspaces. When the subspaces are $k$-dimensional subspaces of $\mathbb{R}^n$, this can be cast as finding the center of a minimum enclosing ball on a Grassmann manifold,…