Search Results
Search type | Search syntax |
---|---|
Tags | [tag] |
Exact | "words here" |
Author |
user:1234 user:me (yours) |
Score |
score:3 (3+) score:0 (none) |
Answers |
answers:3 (3+) answers:0 (none) isaccepted:yes hasaccepted:no inquestion:1234 |
Views | views:250 |
Code | code:"if (foo != bar)" |
Sections |
title:apples body:"apples oranges" |
URL | url:"*.example.com" |
Saves | in:saves |
Status |
closed:yes duplicate:no migrated:no wiki:no |
Types |
is:question is:answer |
Exclude |
-[tag] -apples |
For more details on advanced search visit our help page |
Operations research, linear programming, control theory, systems theory, optimal control, game theory
2
votes
Accepted
optimization over positive semidefinite matrices
$S$ must be positive-definite, not just positive-semidefinite, else
$AS^{-1}$ does not exist. Suppose $A$ is positive-definite,
and let $A^{1/2}$ be its positive-definite square root.
Then the suprem …
17
votes
Accepted
What is the minimum of this quantity on $S^{n-2}\times S^{n-2}$?
The minimum must occur at vectors $x,y$ where
$x_i$ and $y_i$ take only two values each.
This should make it easy to check Neil Strickland's
experimental result (where $x$ and $y$ are indeed of this f …
5
votes
$\min(\det(\mathbf{A}))$ for special matrix $\mathbf{A}$
To answer Question Q2: Yes, as the special case
$u_j = \alpha p_j$ of the following result.
We use $j,k$ for the indices rather than $i,j$
because we need $i = \sqrt{-1}$.
Proposition. For pairwise di …
5
votes
Accepted
$\min(\det(\mathbf{A}))$ for special matrix $\mathbf{A}$
Q1 The determinant is $\prod_{n=1}^{N-1} (1 - e^{-2\alpha(p_{n+1}-p_n)})$.
Q2 Yes, using the answer to Q1.
Q3 Yes, using the answer to Q1.
The formula for Q1 is proved by induction on $N$.
The ba …
8
votes
Maximum of the Vandermonde determinant / minimum of the logarithmic energy
Since you know already that the optimal $a_i$ have
$2a_i + 1 = x_i = \pm 1$ and the roots of $P'_{n-1}$,
the calculation of $V_n$ comes down to the discriminant of $P'_{n-1}$,
its leading coefficient, …
5
votes
The distribution of the shortest path through $n$ points
Robert Israel proved a lower bound proportional to $n^2 (c/\beta)^{2n}$.
I claim an upper bound of much the same shape, $O(n(Bc)^{2n})$,
for some constant $B > \beta^{-1}$, namely $\sqrt{\pi e/2} = 2. …