**0**

votes

**1**answer

326 views

### Supremum in a Markov chain model

A Markov chain $X$ with finite state space $\{1,2,\cdots,N\}$ is defined on a probability space $(\Omega, P, \mathcal{F})$ equiped with filtration $\{\mathcal{F}_t\}$. And we assume that we can reach ...

**1**

vote

**0**answers

96 views

+50

### A path optimisation problem

Consider a graph of $n$ nodes randomly located in $[0,1]^2$. Each node moves following a path randomly chosen from the set of all possible paths. Regard nodes as attackers. A policeman seeks an ...

**0**

votes

**0**answers

26 views

### The non-singular controls always in neighbourhood of singular controls?

Consider the case of a right invariant affine distribution: $D_{U} = \{ aU + \lambda bU | a,b \in \mathfrak{su}(n), \lambda \in \mathbb{R} \}$ on $SU(4)$.
Consider the equations:
...

**3**

votes

**1**answer

107 views

### Singular curves of affine distributions on a Lie group

Are there any results about the rigidity of singular curves of rank 1 affine distributions on a connected compact Lie group?
Specifically the case of a right invariant affine distribution: $D_{U} = ...

**2**

votes

**0**answers

57 views

### Learning rule for recurrent neural network with flexible time steps

Summary: I want to train a recurrent network to output some answers, but the recurrent network is allowed to re-iterate through itself a flexible number of times for each input-output pair.
Why this ...

**4**

votes

**1**answer

177 views

### Is it possible to solve the argument maximization problem $\arg\max_x \langle x,l \rangle −f_1(x)−f_2(x)$ via convex duality?

I am attempting to solve the argument maximization problem
$$\arg\sup_x \{ \langle x,l \rangle − f_1(x)−f_2(x) \} \ \ \ \ \ \ \ \ \ \ (1)$$
where the functions $f_1$ and $f_2$ are concave but ...

**0**

votes

**0**answers

21 views

### Duality for Generalization of standard Convex

in accordance to the previous question about KKT condition for generalization to standard convex, here I look for the dual problem to the generalized convex problem. the clear questions are :
is it ...

**0**

votes

**2**answers

270 views

### Mediated envy-free and efficient cake cutting with n=2?

Is there an algorithm in literature to compute an efficient (pareto optimal) and envy-free cake cutting when there are only $n=2$ players and a mediator?

**1**

vote

**0**answers

39 views

### Attainability of Global Optima In Optimal Control

Given a manifold $M$ and a set of smooth functions of one real variable $\mathcal{A}$ and a 'control system' type first order differential equation:
$\frac{d x(t)}{dt} = F(x,u)$
one can consider the ...

**1**

vote

**0**answers

64 views

### A (non-convex) minimization quadratic programming problem with d constraints

Minimize $0<\omega_{dd}<2$ subject to
$$\sum_{j=1}^{d}(\omega_{dj} - \omega_{ij})^{2} \geq 4, i=0,1,...,d-1,$$
where $-2<\omega_{ij}<2$ is known for $0 \leq i \leq d-1$ and $1 \leq j \leq ...

**1**

vote

**1**answer

181 views

### No strong duality In spite of Slater's condition

I was reading some course notes here.
On Page 8, it says:
Note that strong duality holds here (Slater's condition), but the
optimal value of the last problem is not necessarily the optimal
...

**1**

vote

**0**answers

78 views

### For of a special case of $Ax>=b$, are there always integer solutions?

The input consists of two integers $n\geq 2$ and $K\geq 2$, and a vector of positive integers $b$ of size $n$. We assume that $\sum_i b_i$ is a multiple of $K$.
The output is a matrix $A(n\times n)$ ...

**0**

votes

**0**answers

32 views

### Non-coherent estimation problem

I have the following signals
$$\left[\begin{array}{c} y_{mn} \\ y_{nm}\end{array}\right] =\left[\begin{array}{c} x_{n} \\ x_{m}\end{array}\right]h_{nm} +\left[\begin{array}{c} e_{mn} \\ ...

**1**

vote

**0**answers

91 views

### Proximal mapping of composition with linear operator

Let $A$ be an orthogonal matrix. Then the proximal mapping $prox_{f \circ A}(x)$ can be evaluated efficiently by
$$
(I + \partial (f \circ A))^{-1}(x) = prox_{f \circ A}(x) = A^T prox_{f}(A x),
$$
as ...

**2**

votes

**1**answer

146 views

### Can the nonlinear matrix equation $Bx=p+sgn(x)$ have an explicit solution?

Given $n > 0$, $0 \leq i \leq n$ is an integer, $D = diag(d_1, \dots, d_n)$ is positive definite, $e_i$ is the $i$th column of a $n \times n$ identity matrix, $u \in R^n$ such that $B = D + u * ...

**0**

votes

**0**answers

44 views

### An obstacle problem

Let $f:[0,T]\to \mathbb{R}$ be an increasing function with $f(0)=0$. We want to maximize $f(T)$ with the following constraints:
$|f^\prime(t)|\le M,\quad \forall t\in[0,T]$
$f(t)\le g(t),\quad ...

**4**

votes

**2**answers

82 views

### Questions concerning convergence rate of Iterated Projections

Assume for simplicity $C_1,C_2,...,C_n\subset \mathbb{R}^m$ to be closed and convex subsets with $\underset{i=1}{\overset{n}{\bigcap{}}}C_i\neq\emptyset$.
Let $x^0\in\mathbb{R}^n$ and define the ...

**2**

votes

**0**answers

47 views

### Singularities of the Quantum propagator (baby version)

Given $a,b \in \mathfrak{su}(4)$ which are taken to generate the whole algebra, consider the following map $V:\mathbb{R}^{2} \rightarrow SU(4)$:
$V : (w_1, w_{2}) \mapsto e^{(a+w_2 b)} e^{(a+w_1 b)}$
...

**1**

vote

**0**answers

59 views

### Fréchet differentiability of functional defined by a integral [closed]

I want to prove that if the functional $I: \mathcal{C}^1[t_0,t_f] \rightarrow \mathbb{R}$ defined by
$$
I(x) = \int_{t_0}^{t_f} F(x, \dot{x},t)\,dt
$$
is Fréchet differentiable if $F$ is ...

**7**

votes

**2**answers

130 views

### What are the upper bound and stability conditions for the following simple linear system?

Consider the following linear system
$$\dot{x}=\sum\limits_{i=1}^{m}{{{\alpha }_{i}}}\left( t \right)\cdot {{A}_{i}}\cdot x \quad (1)
$$
where, $x\in {{\mathbb{R}}^{n}}$ represents the state vector, ...

**0**

votes

**1**answer

78 views

### Constrained optimal control problem

I am trying to solve an optimization problem which is probably reminiscent of optimal control theory but all of this is not exactly my field of expertize and I am a little bit lost in translation. If ...

**0**

votes

**0**answers

53 views

### Law of motion when initial condition is perturbed

We know how to find the law of motion (Ito process) of the value function:
$$V_t(x)=E\Big{[}\int^{T}_te^{-r (s-t)}f(s,X_s)ds+e^{-r (T-t)}g(T, X_{T})|\mathcal{F}_t\Big{]}$$
such that
...

**1**

vote

**0**answers

62 views

### About optimizing a convex function on a hypercube

Given a real valued convex function $g$ on $[-1,1]^n$, let $f$ be the restriction of it on the hypercube $\{-1,1\}^n$. I want to find a vertex on the hypercube $\{-1,1\}^n$ on which either (1) $f$ ...

**5**

votes

**2**answers

112 views

### The use of modules in control theory

So far I have seen the use of vector spaces in control theory and other notions from linear algebra; So I wonder if there's a use of this abstraction of modules over rings in control theory? any ...

**3**

votes

**1**answer

33 views

### Parameter uncertainties in LQR

I have a question about LQR.
I apply optimal controller by solving Ricatti equation based on normal plant. Suppose that I have one or few parameter variations in the plant that changes some values in ...

**3**

votes

**2**answers

114 views

### Level sets on $SU(4)$

Given $G \in SU(4)$, what are the level sets of the function $F:SU(n)\rightarrow \mathbb{R}$ defined by $F(V) = |tr(G^{\dagger}V)|^2$?
Can they be written only in terms of abstract linear maps, not ...

**2**

votes

**1**answer

304 views

### Linear and Isometric Automorphism Groups of the PSD Cone

Let $S_+$ be the cone of psd matrices ($n\times n$ real symmetric positive semidefinite matrices). This cone is a metric space induced from the inner product $\langle A,B\rangle = tr (AB)=tr(BA)$.
...

**2**

votes

**1**answer

201 views

### Simultaneous integral equation on $SU(n)$

Consider a smooth curve $U_s:[0,T] \rightarrow SU(4)$ which solves:
$\frac{d U_s}{ds} = (a + w(s)b)U_s$
for some given $a,b \in \mathfrak{su}(4)$ (which generate $\mathfrak{su}(n)$) and a smooth ...

**18**

votes

**4**answers

1k views

### Fairest way to choose gifts

Suppose that a parent brings home from a trip $2n$ gifts of roughly
equal value for his/her two children. The children get to choose one
at a time which gifts they want. What is the fairest way to do ...

**0**

votes

**1**answer

154 views

### Existence of a Lie algebra element orthogonal to the adjoint orbit of another element

Consider a compact, semi-simple, connected Lie group $G$ and its Lie algebra $\mathfrak{g}$. Denote the Killing form by $K$.
Given a single $A \in \mathfrak{g}$ when (i.e. which groups and which $A$) ...

**35**

votes

**1**answer

2k views

### Optimization problem arising from the study of zeta zeros

Motivation: The following problem arose in [1] while studying the vertical distribution of the zeros of the Riemann zeta-function. At the time, my collaborators and I were unable to solve it and I ...

**1**

vote

**2**answers

304 views

### Are there some algorithms to solve the diagonal matrix $X$ to the following matrix equation?

Suppose $X$ is an unknown $m \times m$ diagonal matrix. Given a scalar $0<c<1$, and a matrix $A$ of $m \times m$ size whose entries $0<A_{i,j}<1$. Are there some algorithms to find the ...

**0**

votes

**0**answers

33 views

### Continuous time dynamic programming: Quadratic guess for value function

In a control problem like so:
$$J = min \int_0^{t_f} Qx^2 + Ru^2 dt $$
$$\dot{x} = Ax + Bu$$
$$x(0) = x_0$$
The regular Linear Quadratic Regulator is attained by asssuming that the optimal value ...

**10**

votes

**2**answers

218 views

### A generalization of Chebyshev polynomials

What is the monic polynomial $p(x)$ of degree $n$ which minimizes $\max_{x \in [-1,1]} |p(x)|$? The answer is the Chebyshev polynomial, and its largest value on $[-1,1]$ is $1/2^{n-1}$.
Now suppose ...

**3**

votes

**1**answer

232 views

### Nearest trio of neighbours for non-intersecting ellipses

I'm working on a problem which is to find the closest trio of neighbours for a set of arbitrarily placed non-intersecting ellipses. As a new user I'm not allowed to include image tags but I've ...

**3**

votes

**1**answer

230 views

### Maximum distance of points in intersection of balls

let $B_\delta(p):=\{x\in\mathbb{R}^d:||x-p||_2\leq \delta\}$ be a $d$-dimensional closed ball.
Now I do not have one ball, but four:
$B_{r_1}(p)$, $B_{r_2}(p)$, $B_{s_1}(q)$ and $B_{s_2}(q)$. ...

**0**

votes

**0**answers

44 views

### Nonlinear optimization problem with inequality constraints

Consider a real valued function $g(x_i)=\frac{1}{a_1+ \frac{a_2}{x_i}}, \forall i=\{1,2,3,...,n\}$.
The objective function $H$ is
$H=\sum_{i=1}^{n}\frac {1}{g(x_i)-a_3x_i}$
The optimization ...

**0**

votes

**1**answer

244 views

### A problem about a matrix norm on $\mathfrak{su}(4)$

Given a fixed $B \in \mathfrak{su}(4)$ is it possible to solve for $F$:
$\sigma^{\text{max}}\left(\frac{A}{F(A)} + B \right) = 1$, $\forall A \in \mathfrak{su}(4)$. A theorem in ...

**1**

vote

**1**answer

28 views

### Finding an unfrustrated set of local linear constraints with given minimal value

Let $ \{F_{i}\} $ be a finite set of linear functionals on a convex compact subset $B\subset\mathbb{R}^{n}$ such that each $F_i$ is $k$-local (acts on $k\ll n$ variables only).
Assume ...

**2**

votes

**1**answer

74 views

### Do the values of the differential of a function on a Lie group with a single maximum span the Lie algebra?

Consider: a vector field $X=\nabla \phi$ on a compact, semi-simple, connected matrix Lie group $G$ where $\phi$ as a smooth scalar field on $G$ possessing only a single maxima which topologically is a ...

**0**

votes

**0**answers

35 views

### Relaxation of non-convex QCQP with one quadratic and one linear constraint

According to Boyd we know that a non-convex QCQP problem with one quadratic constraint has strong duality with the relaxed SDP or Lagrange counterpart. (check "Convex Optimization" by Boyd, Appendix ...

**2**

votes

**1**answer

196 views

### Expected value (probability) maximization with binomial distribution

I need to solve an optimization problem that involves an expected value like
$$F(n,x) = \sum_{k=0}^n \binom{n}{k} p^k(1 - p)^{n - k} f(k,x).$$
Here $f(k,x)$ is actually a probability coming from a ...

**6**

votes

**4**answers

867 views

### Simplex method for SDP?

I know the interior point method works both for Linear Programming (LP) and semidefinite programming (SDP). My question is, can the other popular method for solving LP, namely the simplex method, be ...

**5**

votes

**0**answers

157 views

### Is there a name for this quantity between two distributions?

Let $f$ be a probability density on a compact domain $D$, and say that $x_1,\dots,x_n$ are samples from $f$. If we wanted to compute the Wasserstein distance between $f$ and the empirical ...

**4**

votes

**2**answers

86 views

### Convex optimization with full subdifferential information

Can anyone direct me to any algorithms or theorems that describe the difficulty of solving a non-smooth convex optimization problem for the special case where the full subdifferential is available? ...

**0**

votes

**1**answer

104 views

### Gradient on $SU(n)$

I'm trying to calculate the gradient (wrt to the bi-invariant metric) of the following functions $F_1, F_2 : SU(n) \rightarrow \mathbb{R}$ defined by $F_1(U) = | Tr (G^{\dagger} U) |^2$, $F_2(U) = \Re ...

**3**

votes

**1**answer

93 views

### Basic result in semi-infinite linear programming

Consider a standard linear program of the form $$\textrm{minimize}_x~~~~ c^Tx~~~~ s.t. \\ Ax = b \\ x \geq 0$$ with $x\in \mathbb{R}^n$ and $A \in \mathbb{R}^{m \times n}$. It is well known that, if ...

**0**

votes

**0**answers

46 views

### Finding a movement taking out of a convex set

There is a convex set $S$ as the hull of M points in an D-dimensional Euclidean space and a point $\vec P$ in the set. Then, there is a set of vectors $\vec W$ taking the form $\vec W=\sum_{i=1}^N ...

**2**

votes

**1**answer

72 views

### Fixed point iteration on symmetric biconvex function

Suppose $X\subseteq\mathbb{R}^n$ is a convex set and that a function $g(x,y):X\times X\rightarrow\mathbb{R}_+$ is smooth, "strictly biconvex" (strictly convex in $x$ and $y$ independently but not ...

**13**

votes

**4**answers

413 views

### Maximum of the Vandermonde determinant / minimum of the logarithmic energy

The problem is to find the asymptotics (as $n\to\infty$) of the maximum (say $M_n$) of the Vandermonde determinant
$$V_n:=\prod_{0\le i<j\le n-1}(a_j-a_i)
$$
over all $a_0,\dots,a_{n-1}$ such ...