**3**

votes

**1**answer

95 views

### A difficult combinatorial optimization problem

Let $\mathcal{J}$ be a closed, bounded, compact, convex set in $\mathbb{R}^L$.
(Notations: vector $\mathbf{x}$ is denoted in bold letters and its $i^{th}$ co-ordinate is denoted as $x_i$. ...

**1**

vote

**1**answer

102 views

### finding permutation matrix I which minimizes TRACE( I* C*( I^T)* D) matrix

I have a problem that is really important for my thesis and i am not studding math so i will be very glad if you help me in this case...
thanks for your help in advance
I want to find permutation ...

**-1**

votes

**0**answers

26 views

### Optimal time control for the system of two non-linear ODE

I have the following system of two non-linear ODE with one control variable (modified model of Lotka-Volterra):
$$\left\{\begin{matrix}
\frac{dx}{dt}=(\alpha-\beta y)x
\\
\frac{dy}{dt}=(-\gamma + ...

**0**

votes

**1**answer

122 views

### A problem on 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 ...

**0**

votes

**0**answers

27 views

### Infinite dimension optimization example

I am searching for an example problem for infinite dimension optimization for continuous time control. I have the algorithm tested on real systems but I would like a problem where the Lyapunov ...

**0**

votes

**0**answers

29 views

### characterization of a certain closed convex cone

Consider $x_1,\cdots,x_n \in \mathbb{R}^d$, and the closed convex cone in $\mathbb{R}^n$ defined by
$$\mathcal{K}(\underline{x}):=\{(\varphi(x_1),\cdots,\varphi(x_n)):\varphi \textrm{ convex on ...

**28**

votes

**1**answer

1k 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 ...

**3**

votes

**1**answer

1k views

### Matrix approximation

Let A be an $m\times n$ matrix and $k$ be an integer. Assume that $A$ is non-negative. We want to find a scalar $\epsilon$ and an $n\times n$ matrix $B$ such that $A\leq A(\epsilon I + B)$ (where ...

**2**

votes

**2**answers

2k views

### Best fit for multiple shapes inside an area

Is there a forumla to come up with the best fit for multiple shapes inside a rectangular area, so that none of the shapes are overlapping?

**1**

vote

**2**answers

225 views

### how to estimate a polyhedron(convex hull) classifier from data sample

Given a set of points $X\in\Re^D$, they have labels $Y\in${$-1,+1$}. I would like to separate the data labeled +1 and the data labeled -1 by a polyhedron.
$min_w \sum_i \xi_i + \frac{1}{2}\|w\|_2^2$
...

**0**

votes

**1**answer

176 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 ...

**4**

votes

**1**answer

144 views

### Rank 1 Approximation of Elementwise Inverse Matrix

I'm wondering whether there is a good way to solve the following optimisation problem.
Given a strictly positive quadratic matrix $A$, find two diagonal matrices $D_1$ and $D_2$ so that
$$ \| D_1 A ...

**0**

votes

**1**answer

475 views

### eigen-decomposition solution? is it unique?

Assume an N*N covariance matrix (Q) which is a positive definite matrix. The decoder X is assumed to be N*s, where s<=N. X is calculated to be s eigenvectors corresponding to s minimum eigenvalues. ...

**26**

votes

**3**answers

1k views

### What is the best way to peel fruit?

A mango made me wonder about this. (See also this question, which is in a similar spirit.)
Fix $L >0$ and a smooth body (possibly nonconvex—pears or bananas are fair game!) $B \subset ...

**2**

votes

**1**answer

94 views

### Necessary conditions for optimality in Banach spaces

Let $X$ denote the non-negative "orthant" of the Banach space $L^2$ (or whatever you call the set of functions in $L^2$ that are non-negative), and let $C$ be a closed, convex subset of $X$. Let $f$ ...

**7**

votes

**2**answers

161 views

### Removing constraints in convex optimization

Say I have a convex optimization problem of the form $$\min_x f(x) ~~ s.t.\\ g_1(x)\leq0,\\\vdots \\g_n(x)\leq 0$$ with all functions convex. Suppose that $x^*$ is a unique optimizer to my problem and ...

**2**

votes

**1**answer

85 views

### Standard names and methods for this type of fitting minimization

In material science research, we have come across the following type of problem.
Given a m by n matrix A, a m vector b, and error tolerance $\varepsilon$, we want to do this minimization
$$\eqalign{
...

**3**

votes

**0**answers

84 views

### This function looks quasiconvex, can't understand why

Suppose that $\mathbf{C}$ is a given matrix with non-negative entries in $\mathbb{R}^{m\times n}$ and $d$ is a given scalar, and let $g(\mathbf{y})$ be defined by ...

**2**

votes

**0**answers

81 views

### Copositivity under tensor products

Is there any symmetric real matrix $A$ such that $A^{\otimes n}$ is copositive for all positive integers $n$, but such that A is neither positive semidefinite nor has just non-negative entries?
...

**0**

votes

**1**answer

31 views

### Sufficient and necessary condition for BIBO stability

I am looking for a reference for the proof of the next claim:
"BIBO—bounded input bounded output—stability.
We claim that a necessary and sufficient condition for a system described
by a linear, ...

**22**

votes

**6**answers

10k views

### Is all non-convex optimization heuristic?

Convex Optimization is a mathematically rigorous and well-studied field. In linear programming a whole host of tractable methods give your global optimums in lightning fast times. Quadratic ...

**0**

votes

**0**answers

28 views

### numerical solver for stochastic optimal control problems

can any one recommend numerical solver (c/c++ library preferred) for stochastic optimal control problems? For deterministic optimal control I found something like that: ...

**5**

votes

**2**answers

627 views

### Problem equivalent to “largest square in a cube”

The "largest square in a cube" problem, which asks for the largest square inside a cube, has a solution as can be seen on this page, which also says that the general problem in higher dimensions is ...

**4**

votes

**2**answers

228 views

### Riemannian metric on a space of “not-quite-smooth” (hyper)surfaces?

Apologies if the title's a bit vague; I'll try to explain everything below, and please let me know if I should clarify anything.
I've been looking for a while at variational problems on polytopes. ...

**5**

votes

**2**answers

338 views

### Heaviest Convex Polygon

Suppose we have an arbitrary function $f : \mathbb{R}^2 \to \mathbb{R}$. For any subset $s \subseteq \mathbb{R}^2$, we can define $g_f(s)$ as the integral* of $f$ over the region $s$. Suppose ...

**7**

votes

**2**answers

411 views

### How to solve such an optimization problem

I encounter the following optimization problem, but I can't solve it.
Given $N$ variables satisfying $0 \leq x_1 \leq x_2 \leq x_3 \leq ... \leq x_N \leq 1$ and an integer $K$ no large than $N$, find ...

**1**

vote

**1**answer

192 views

### Solving a matrix equation $X=c \cdot AXA' +I$ with a diagonal corrections

I am now struggling to solve the matrix $X \in R^{n \times n}$ in the following equation:
$X=c \cdot AXA' - diag(c \cdot AXA')+ I$,
where
(1) $A \in R^{n \times n}$ is a given matrix whose element ...

**3**

votes

**0**answers

70 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 ...

**2**

votes

**2**answers

305 views

### High dimensional Steiner tree

Given n affinely independent points in n-1 dimensional Euclidean space, how is the minimum Steiner tree constructed? Or assuming that the topology of the Steiner tree is given, is there an easy way ...

**7**

votes

**3**answers

328 views

### The distribution of the shortest path through $n$ points

In the big picture, I'd like to know: if I sample $n$ points uniformly at random in the unit square, what is the probability that the shortest path that visits each one of them is very small?
More ...

**0**

votes

**1**answer

100 views

### Linear programming with exponentially many constraints and variables [closed]

From class, I learnt that problems like traveller salesman have a Linear programming representation with exponentially many constraints. Using method of separation, this problem is solved rather ...

**1**

vote

**0**answers

111 views

### lower bound for difference between max cut and min cut

Let $G=(V,E)$ be a graph on $n$ vertices with edge weights $w=(w_e)_{e\in E}$. Let $M^+$ and $M^-$ be the maximum and the minimum cut values, i.e.
...

**1**

vote

**2**answers

131 views

### Combinatorial optimization problem involving infinite spin system

In material science research, I am developing an algorithm to solve an infinite combinatorial optimization problem which I believe is the most natural problem when the system size goes to infinity.
...

**0**

votes

**0**answers

24 views

### Optimization problem involving an entrywise function

Let $X$ a $n\times p$ real-valued matrix and $Y$ a $p\times q$ real-valued matrix. Let $\phi:\mathbb{R} \to \mathbb{R}$ a function. What is the appropriate way to deal with the following optimization ...

**2**

votes

**4**answers

333 views

### Algorithm to find the “optimal” path in a given graph

Assume that $G=(V,E)$ is an undirected connected graph and that $H: V \to \mathbb R$ is a function that assign at each vertex $v \in V$ its height $H(v)$. Think of the pair $(G,H)$ as an energy ...

**3**

votes

**2**answers

3k views

### Linear program to maximize the minimum absolute value of linear functions ?

I'd like to compute
$\max_{x,t} t$ such that $\forall i$, $t < a_i + |x - b_i|$.
where $a_i,\ldots, a_n$ and $b_1,\ldots,b_n$ are fixed and $x \in [0,1]$.
Can this be solved with a linear ...

**0**

votes

**1**answer

46 views

### Generalized assignment problem with no integrality gap

Suppose I am solving the generalized assignment problem, so that I
am given matrices $U$ and $W$ and a vector $c$ (all three of which
have, say, positive entries), and I want to solve
...

**2**

votes

**0**answers

27 views

### kalman filter with delayed (outdated) information

We have a linear system with observation as follows:
$x(t+1)=Ax(t)+Bu(t)+w(t)$
$y(t)=Cx(t)+z(t)$
for given information $y(0\sim t)$, we can construct the dynamics of $\hat{x}(t)$ using the Kalman ...

**2**

votes

**0**answers

85 views

### First Variation of Dyson Series/Magnus Expansion

Given the matrix differential equation $\frac{dU_t}{dt}=A_t U_t$ there are at least two ways to write a formal solution. Both the Dyson series: $U_t = \mathcal{T} e^{\int_{0}^{t} A_t dt}$ and the ...

**6**

votes

**1**answer

240 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 ...

**4**

votes

**1**answer

58 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, ...

**2**

votes

**2**answers

383 views

### Why does not the Hamiltonian depend on the derivative of the state?

I am reading "Optimal Control Theory" from Kirk. When solving the optimal control problem, there is defined The Hamiltonian $H(x(t),u(t),p(t), t)$ as $g(x(t), u(t), t) + p [a(x(t), u(t), t]$ where ...

**0**

votes

**1**answer

71 views

### equation for geodesics of a right invairant Finsler metric on $SU(n)$ which are parallel to a linear affine distribution

I am looking for an equation analogous to the Euler-Poincare equations for a right invariant Finlser metric except I want the geodesics which are parallel to a linear affine distribution on $SU(n)$. ...

**0**

votes

**0**answers

18 views

### Zeros of non-lipschitz functions (when noisy estimates are available only)

Given noisy (martingale difference) of a Lipschitz continuous function $f$ it is known how to compute zeros of it. It is the stochastic approximation approach (by Borkar, Kushner and Yin etc.). Is ...

**1**

vote

**0**answers

70 views

### An optimization problem for a Markov Chain

Consider a Markov Chain $\{X_n\}$ whose transition probability depends on some parameter $\theta$ ($p_{ij}(\theta)$). Now I want to optimize the following quantity
$$\lambda(\theta) = ...

**4**

votes

**0**answers

71 views

### Sufficiency of stationary policy for negative stochastic dynamic programming

Consider a Markov Decision Process with Borel state space $X$ and Borel action space $U$, like the one defined in the book "Stochastic Optimal Control: Discrete-time case" by Bertsekas and Shreve. All ...

**2**

votes

**0**answers

29 views

### Linear control systems

Are there some algorithms to compute the error bound of the difference between the original system and the balance system using the Balance truncation method?

**0**

votes

**0**answers

49 views

### Representation of piecewise functions using variational inequalities

I need some help about how to represent piecewise smooth functions defined over N subintervals by using variational inequalities. From a paper I'm analyzing I get:
"If we can find a function ...

**1**

vote

**1**answer

119 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 ...

**1**

vote

**1**answer

87 views

### A certain instance of the Set Covering problem

Is there any useful structure associated with the following instance of the Set Covering problem?
Let $G$ be a weighted graph and let $\mathcal{P}$ denote the set of all shortest paths between all ...