All Questions
Tagged with mg.metric-geometry nonlinear-optimization
20 questions
0
votes
1
answer
90
views
How to calculate the maximum dimensions of a rectangle inside two concentric circles? [closed]
If I have a rectangle ABCD such that A and B touch two points of the outer circle and CD's touches one point of the inner circle, how could the maximum dimensions of the rectangle be calculated?
...
- 17
0
votes
0
answers
96
views
When can a point be reconstructed from relative angle measurements?
Given a set of points $p_1,\dots,p_n$ in $\mathbb{R}^d$ and a target point $x\in\mathbb{R}^d$, I measure all the angles between all pairs of points and the target point. In other words, I have the ...
- 427
2
votes
1
answer
61
views
$k$-subset with minimal Hausdorff distance to the whole set
Let $(\mathcal{M}, d)$ be a metric space. Let $k \in \mathbb{N}$. Let $[\mathcal{M}]^k$ be the set of $k$-subsets of $\mathcal{M}$. Consider the following problem:
$$ \operatorname*{argmin}_{\mathcal{...
- 2,203
8
votes
0
answers
278
views
The busy Star Guardian
On an infinite plane, the Prime Star has disintegrated into four constituent stars, the North Star, the South Star, the East Star and the West Star, each traveling at a constant speed of $1$ in their ...
- 2,619
3
votes
1
answer
702
views
Maximizing the distance sum of some points inside a circle
Consider $n$ points $\{p_i\}_{i=1}^n$ located inside or on a circle with radius $r$ in the plane. The question is: how to place the $n$ points so that the sum of inter-point distances,
$$J=\sum_{i=1}^...
- 133
-1
votes
1
answer
99
views
Existence of continuous selection for metric projection
Let $(X,d)$ be a separable complete geodesic metric space and let $K$ be a compact (non-empty) subset of $X$. Without assuming things like linearity, the convexity of $K$, and locally convexity, ...
2
votes
0
answers
49
views
A question about strong slopes (nonsmooth analysis)
Context. I'm reading the manuscrip "Nonlinear Error Bounds via a Change of Function" by Dominique Azé and Jean-Noël Corvellec (J Optim Theory Appl 2016), and I'm having a hard time ...
- 6,853
1
vote
1
answer
195
views
Metric / strong slope restriction of function on unit ball in $\mathbb R^m$
Diclaimer. I'm not sure this is the right venue for this question, but I'll give it a try
Definition [Strong / metric slope]. Given a complete metric space $(M,d)$ and a function $f:M \to (-\infty,+\...
- 6,853
3
votes
0
answers
240
views
Optimization with parametric constraints: solution maps
For constrained optimization problems
$$ \begin{array}{ll} \min\limits_{x \in \mathbb R^n} & f(p, x) \\
\text{s.t.} & x \in C \end{array} $$
where $p \in \mathbb R$ is a parameter, we can ...
- 791
1
vote
1
answer
101
views
Embedding a graph in $\mathbb{R}^3$ with partial geometric information
I have a connected, sparse, graph (a molecule to be specific) and I'm interested in associating 3D coordinates with the vertices. Here's the kicker: I already have coordinates for none/some/all ...
- 11
1
vote
0
answers
59
views
Sum of squared nearest-neighbor distances between points on the sides of a rectangle
For positive real numbers $a,b$, let $R$ denote the $a\times b$ rectangle $[0,a]\times[0,b]$. Let $A_1,\dots,A_4$ be points on the sides of $R$, one point on each side. For each $j=1,\dots,4$, let $...
- 128k
1
vote
0
answers
229
views
Distance between quadric surface and point or Intersection of sphere and quadric surface
I asked a similar question on math.stackexchange, but the answer wasn't quite ideal for my application. Apparently analytic solutions are surprisingly rare for general quadric distances.
Given a ...
- 11
7
votes
2
answers
1k
views
Maximum average Euclidean distance between $n$ points in $[-1,1]^n$
For my research I have designed a metric that is based on the average Euclidean distance between $n$ points in the $n$-dimensional hypercube $[-1,1]^n$. However, I have a hard time finding the maximal ...
- 71
5
votes
1
answer
188
views
Transport tubes in a sphere
Let $S$ be a unit-radius sphere in $\mathbb{R}^3$.
Q0. Where should one place $3$ disjoint lines intersecting $S$ to minimize the maximum distance between
any two points in $S$, where distance is ...
- 151k
3
votes
1
answer
1k
views
Find a line such that sum of perpendicular distances of points to the line is minimized
Given a set of points (column vectors) $S = \{p_1, p_2, \cdots, p_n\} \subset \Re^d$, let $A \in \Re^{n \times d}$ be a matrix of which each row is just $p_i^T$. It is easy to find a unit vector $s_1$ ...
user49129
1
vote
1
answer
143
views
Smooth unit vector field on a tetrahedron to interpolate vertex constraints
For a tetrahedron $T\subset \mathbb{R}^3$ with vertices $r_i\in \mathbb{R}^3$ , $i=1,\ldots,4$, and unit vectors $u_i\in \mathbb{S}^2$ at each vertex $i=1,\ldots,4$
consider the (energy) functional
$$...
- 1,676
2
votes
0
answers
118
views
Containing a "fuzzy" ellipsoid within an ordinary ellipsoid
Consider the ellipsoid described by the inequality $(x - x_c)^T P^{-1} (x - x_c) \leq 1$, where the vector $x_c \in \mathbb{R}^n$ denotes the center of the ellipsoid and the symmetric positive ...
7
votes
1
answer
422
views
Generalization of the equilateral triangle?
I consider points in the two-dimensional plane.
An equilateral triangle is a set of three points in the plane which are equidistant.
Suppose now I have $n$ points $x_1,...,x_n$. What is the ...
- 840
2
votes
0
answers
697
views
Find minimum-area ellipse enclosing a set of ellipses, all centered at the origin
Given a set of N > 2 (two-dimensional and coplanar) ellipses, all centered at the origin, how do I find the ellipse with the minimum area which encloses all of them?
Background:
Thanks to Will Jagy ...
- 21
6
votes
2
answers
2k
views
Find minimum-area ellipse which encloses two ellipses
I need an efficient algorithm to find the ellipse with the smallest possible area which encloses two given ellipses. The given ellipses are constrained to have coincident centers at the origin but can ...
- 61