The global-optimization tag has no wiki summary.

**0**

votes

**1**answer

81 views

### Maximum of a mollified/convolution function

I have a function $f:{\mathbb R}\rightarrow {\mathbb R}_+$ which has a unique maximum at $x=0$. $f$ can be symmetric or asymmetric. I am interested on the mollified-f function
...

**10**

votes

**0**answers

199 views

### “Small” maps from sphere to sphere

Start with a continuous map $f:S^{n+k} \rightarrow S^n$ (round unit spheres). The graph of $f$ lives in $S^{n+k}\times S^n$ and suppose it has a surface area (as a subspace of co-dimension $n$). Now ...

**6**

votes

**0**answers

88 views

### A specific case of the $p$-center problem

Given a fixed positive integer $m$, let $\cal{S}$ be the subset from $\mathbb{R}^m$ defined as $\cal{S} = \{u \in \mathbb{R}^m \mid \forall i \in \{1, \dots, m\}, u(i) > 0$ and $\sum_{i=1}^m{u(i) = ...

**5**

votes

**0**answers

412 views

### Maximizing the matrix norm

Hi all,
I wish to find a 3x3 rotation (orthogonal) matrix $\mathbf{R}$ such that it maximizes the following matrix norm:
$||\mathbf{A} \mathbf{D}_r \mathbf{D}_b ||_2$
where $\mathbf{A}$ is a known ...

**3**

votes

**0**answers

387 views

### Minimum weight bipartite graph clique covering

I was wondering if anyone here could give me any pointers as to how to solve the following problem.
Let $B=(L,R,E)$ be a bipartite graph, and $\forall u\in L\cup R$, let $c_u$ be a cost associated to ...

**2**

votes

**0**answers

173 views

### Could SVD be used to optimize the partial inner-products?

Suppose a set $N$ of $n$ distinct points in $m-$dimensional space is given in $X\in\mathbb{R}^{n\times m}$. Also, suppose a subset $L\subset N$, $|L|=l<m<n$, with
$m-$dimensional coordinates in ...

**2**

votes

**0**answers

158 views

### modification of singlestart in global optimization

When minimizing a nonconvex function $f : \Omega \rightarrow \mathbb{R}$ that may have multiple minima, there are some very simple strategies to improve the odds of finding the global minimum point. ...

**1**

vote

**0**answers

33 views

### Likelihood convexification

I am doing constrained vector optimization using a non-convex non-linear likelihood function. My problem is of the following form:
$$\begin{align*}\hat Q &= \underset{\vec Q}{\arg\min} -\log ...

**1**

vote

**0**answers

36 views

### Modified Orthonormal Procrustes Problem

In the general orthonormal Procrustes problem, we want to find an orthonormal matrix $C$ to minimize $\|Y-XC\|_F^2$, where $Y$ is a known $n\times q$ matrix, $X$ is a known $n \times m$ matrix, and ...

**1**

vote

**0**answers

37 views

### Changing a nonlinear equality constraint into some conic inequality plus rank constraint

If we have a constraint optimization problem in which one of our constraint is $\prod\limits_{k = 1}^N {\left( {x - {a_k}} \right) = 0} $ . How could this nonlinear equality condition be changed into ...

**1**

vote

**0**answers

74 views

### range of the difference-of-two-qubit-$4 \times 4$-density-matrix-determinants

The determinant of a two-qubit $4 \times 4$ density matrix--that is, a Hermitian, nonnegative definite matrix with unit trace--lies between $0$ and $(\frac{1}{2})^8$. (A "pure state" has determinant ...

**1**

vote

**0**answers

110 views

### Maximizing an integral over a convex region

Let $C$ denote a compact, convex region in the plane containing the origin with unit area, and let $f$ be a probability distribution on $C$. Let $f^\ast$ denote the distribution that maximizes the ...

**1**

vote

**0**answers

142 views

### Constructing an $\epsilon$-net for a Lipschitz subspace of $L^2$

Let $X$ be a subset of $L^2([0,1])$ which contains only Lipschitz function.
Also, the member of $X$ are uniformly bounded
$$
|x(t)| < M, \text{ for all $x \in X$ and $t \in [0,1]$}.
$$
Let $F: X ...

**1**

vote

**0**answers

99 views

### Trying to get an idea of the maths I could use for this optimization problem

Firstly, apologies if some of the notation or terminology is odd, or if I am defining functions that have standard notation associated with them already - I am not familiar with the concepts in this ...

**1**

vote

**0**answers

128 views

### An $L^{\infty} Version of Principal Component Analysis?

I have a $k$ by $n$ matrix $A$, with $k \ll n$. In case it helps, the $k$ rows are orthonormal.
I'm interested in finding a $k$ by $k$ orthogonal matrix $M$ so as to maximize the $L^{\infty}$ norms ...

**1**

vote

**0**answers

189 views

### On the convergence of a special fixed point iteration

The problem is actually a quadratically constrained quadratic program. And the formulation is:
$max: \frac{1}{2}x^TQx + d^Tx$
$s.t. x\in R^{n,+} ,\sum_{i\in I_p}x_i^2=1, p=1..k$
where $d\in ...

**0**

votes

**0**answers

45 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: ...

**0**

votes

**0**answers

44 views

### minimizing concave function

I am interested in using the algorithm of Harold Benson described in his 1991 paper: "A Branch and Bound-Outer Approximation Algorithm for Concave Minimization over a Convex Set". In the paper, he ...

**0**

votes

**0**answers

58 views

### Sufficient optimality condition for a non-smooth quasiconvex problem

The result of relaxing to an integer program is the following optimization problem:
$$\min_{\textbf{x}} \sum_{i=1}^n \alpha_i h(x_i)\quad subject \; to \quad A\textbf{x} = \textbf{0}$$
where ...

**0**

votes

**0**answers

86 views

### The role of subgradient in programming with nonsmooth functions

It is obvious that there is similarity between subgradient and gradient. The subgradient of smooth functions is reduced to gradient. I have two questions.
The first is does there exist subgradient ...

**0**

votes

**0**answers

58 views

### equivalence between primitive and dual

Hi everyone! I have a problem about the duality gap of the primitive problem and the dual problem.
This problem comes from a probabilistic model named Lagrangian UVM.
...

**0**

votes

**0**answers

584 views

### optimization of a separable function

Hello everyone,
this is a optimization problem whose objective function is separable:
$$F(x)=\sum_{i=1}^n\frac{\theta_i^2}{4}\sum_{j=1}^m\left(1+\rho ...

**0**

votes

**0**answers

297 views

### Optimization of a matrix with an objective function (for ML)

Hi.
I need to do max. likelihood for an objective likelihood function L (minimize it), and the target is a matrix. ie:
$$min_KL(K)$$
For example:
K is, let's say, of size 3x3 and with initial ...

**0**

votes

**0**answers

92 views

### minimizing the integral of a function over square sets.

Hi!
I'm interested in some problems, but to be honest i'm not sure of the field they belong to.
Let $h(x,y)$ be a bivariate function on $X^2$, where $X$ is some nice topological space (for instance ...