Nonlinear objectives, nonlinear constraints, non-convex objective, non-convex feasible region.

**1**

vote

**1**answer

18 views

### Entropy difference dominance of decreasing sequences

Consider a collection of positive integers $\{a_i\}_{i=1}^m$ and the distribution $p_i=\frac{a_i}{\sum_{i=1}^ma_i}$.
Similarly for the collection $\{a_i\}_{i=1}^{m+1}$ form the distribution ...

**1**

vote

**1**answer

44 views

### Entropy dominance of certain restricted sequenes

Say you have positive $\{a_i\}_{i=1}^n$ and you have $p_i=\frac{a_i}{\sum_{i=1}^na_i}$, then assume you have a $C$ such that $C<2a_n\ll\sum_{i=1}^na_i$ (that is $C$ is not very large), then define ...

**2**

votes

**1**answer

49 views

### Entropy dominance

Let $0<a<b<c$ be distinct positive reals.
Define four different probability distributions:
$$\mathcal{P}_{ab}:P_{a,ab}=\frac{a}{a+b}=1-P_{b,ab}$$
...

**0**

votes

**0**answers

19 views

### Maximizing a certain concave function over a non-convex set

I have been working on a problem which involves maximizing a concave function over a non convex constraint set. The problem is the following $$max. \frac{1}{2}x^TBx\\ s.t.\ x_i(1-x_i)=0,\ \ ...

**-2**

votes

**0**answers

32 views

### Solving nonlinear system of ODEs

I have the following system of differential equations:
$$
\begin{cases}
\frac{dx}{dt} = (1 - y) x - 0.4 xu
\\
\frac{dy}{dt} = (x - 1)y - 0.2yu
\\
\psi_1' = - \frac{dH}{dx} = (-1 + 0.4u)\psi_1 + y ...

**1**

vote

**1**answer

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

**11**

votes

**2**answers

495 views

### Conjecture on maximum of symmetric combinatoric function

A curious symmetric function crossed my way in some quantum mechanics calculations, and I'm interested its maximum value (for which I do have a conjecture).
(The question was first asked at math.SE, ...

**-1**

votes

**0**answers

32 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

44 views

### Finding maximum of a function with unfixed number of variables

Can anybody solve this:
For a constant positive integer $n\geq6$
find $k$ and positive integers $a_{1},a_{2},...,a_{k}$
that maximize the expression
...

**0**

votes

**1**answer

81 views

### How to convert non-PSD matrix to PSD matrix?

I have a mixed-integer optimization problem with the following constraint matrix $Q_1$:
\begin{array}{cccccc}
0 & 0 & 0 & 0 & 0 & 1 \\
0 & 0 & 0 & 0 & -1 & 0 ...

**0**

votes

**0**answers

35 views

### Best s-term approximation and unit balls in weak $\ell^p$ norm

In the book "A Mathematical Introduction to Compressive Sensing" by Foucart and Rauhut there is the following asymptotic estimate at page 332, equation (11.1):
$$\sup_{\mathbf{x}\in B^N_{r,\infty}} ...

**1**

vote

**1**answer

71 views

### Nonlinear system of equations whereas most of the equations are linear. How to minimise operation?

Let us say we have a n * n system of equations like KU=F where K is a n*n matrix and U and F are n*1 vectors. K and F are defined and the final goal is to find U values.
K is a sparse banded matrix ...

**0**

votes

**0**answers

28 views

### How can be a conservative field constraint be efficiently implemented in a continuous optimization problem?

Suppose we have the following continuous optimization problem:
$$
\underset{x}{\mathrm{minimize}}f\left(x\right)
$$
subject to
$$
\exists X:\nabla X=Jac\left(X\right)=x
$$
where $f$ is a function ...

**-3**

votes

**1**answer

33 views

### Convert constraint to do convex optimization or use Lagrange multiplier method [closed]

$w_1, w_2, w_3 ... w_n$ are the weights I need to find
I have the following constraint:
$|w_1| + |w_2| + .. |w_n| <= 5$
That is the sum of the absolute values of the weights has to be less than ...

**4**

votes

**2**answers

241 views

### Convex Sets and Nearest Neighbors

For a set $S \subseteq \mathbb{R}^n$ and a point $x \in \mathbb{R}^n$, let $c_S(x)$ be the point $s \in S$ that minimizes $\|x-s\|$ if such a point exists and is uniquely determined. It is known that ...

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

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

**0**

votes

**0**answers

34 views

### Convergence of Coordinate Descent / Alternating directions

My question regards this method
http://en.wikipedia.org/wiki/Coordinate_descent,
where at each step a function $f$ is minimized along one coordinate axis (or block of coordinates).
Assume that $f: ...

**0**

votes

**0**answers

61 views

### Maximizing the “uniformity” of a probability measure, with constraints, via path length minimization

Background
I want to find a probability measure for a continuous random variable, subject to moment constraints, that is maximally "uniform", as defined below:
Definition: Maximally Uniform ...

**0**

votes

**0**answers

37 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

20 views

### Recursively calculate Tikhonov regularizer in b-spline objective function

I'm trying to write a program to calculate cubic b-spline based on set of inputs. But I can't figure out how to calculate value of Tikhonov regularizer.
My b-spline function is this:
I have ...

**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

143 views

### Levenberg's original article “A method for the solution of certain problems in least squares”

Does there exist any digital copy of the original article (or a transcript) K. Levenberg, A method for the solution of certain problems in least-squares, Quart. Appl. Math. 2 (1944): 164-168?
It is ...

**2**

votes

**2**answers

160 views

### How to fit the parameters of differential equations with known data?

I have the following data from chemical kinetics research to fit the parameters of ordinary differential equations:
$$
\left[
\begin{array}{ccccccc}
\text{No.}& t & y_1(t)&y_2(t) & ...

**1**

vote

**0**answers

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

**0**

votes

**0**answers

48 views

### Finding gradient of an optimization

I am trying to find the gradient of the following optimization problem and then add to objective, but I got some trouble in computing. Could you please help me?
Assume that we have an optimization ...

**4**

votes

**1**answer

177 views

### optimization problem, any solution?

The objective is as follows:
$\min_{\mathbf{F}} a Tr(\mathbf{F} \mathbf{F}^H) - Re\{\mathbf{b}\mathbf{F}^H \mathbf{C} \mathbf{F} \mathbf{d}\}$
$s.t.\ \ \ Tr(\Sigma \mathbf{F} \mathbf{F}^H)<p$
...

**0**

votes

**0**answers

51 views

### Solution of a nonlinear system of two equations

Given the matrix $A_{M,N}$ with $N\gt M$, the vector $y$, I have to find the vectors $x$ and $u$, satisfying the following equations:
$$D(x)x=A^Tu$$
$$y=Ax$$
where: $$D(x) = \left| \begin{array}{ccc}
...

**0**

votes

**0**answers

37 views

### A Optimization problem using co-ordinates of joint numerical range.

Let $\mathbf{A}_1,\dots,\mathbf{A}_L$ be $N\times N$ hermitian matrices. Define the mapping from the $N-$dimensional unit sphere to $\mathbb{R}^L$ as
\begin{align}
...

**0**

votes

**2**answers

92 views

### Approximate solution to large mixed integer programming problem

What are the available approaches to find an approximate solution to a large mixed integer programming problem?
I ran my problem in the Gurobi MIP solver.
It can find a feasible solution in ...

**2**

votes

**3**answers

302 views

### Solving a quadratic matrix equation with non-squared matrix

I was trying to solve the problem of finding the value of a non-squared matrix $T$ ($n \times m$) which solves
$$ T^T T = X$$
where $X$ is a symmetric and positive semidefinite $m \times m$ matrix, ...

**4**

votes

**1**answer

120 views

### Finding a point maximizing the minimal distance to a set of points

Given a set of of $N$ points $\{\mathbf x_i \in \mathcal{S}^d\}_{i = 1, \ldots, N}$, where $\mathcal{S}$ is a set of possible values, how can I find the point $\mathbf x^*$ that maximizes the minimum ...

**1**

vote

**2**answers

51 views

### Linear Programm with matrix [closed]

Is there a name for problems like this
min norm(Cx)
Ax = b
where C is a matrix and norm is the maximum norm.
This is kind of like a linear Programm. Could this be rewritten as linear programm? Or Any ...

**3**

votes

**2**answers

120 views

### QR-Decomposition of matrix valued function

Suppose I have a matrix valued function
$$
F:\mathbb{R}\rightarrow\mathbb{R}^{m\times n},\qquad F(x)=\tilde Q\tilde R+xu_1v_1^T+xu_2v_2^T
$$
where $\tilde Q\in\mathbb{R}^{m\times m}$ is orthogonal, ...

**2**

votes

**1**answer

229 views

### How to minimize $-\sum p_b \ln{p_b}$?

Consider multisets of the form $A = \{a_1,\dots,a_n\}$ of integers. Let $q = P(a_i = a_j)$ when $i$ and $j$ are chosen independently and uniformly from $\{1,\dots, n\}$. Let $B$ be the set of ...

**4**

votes

**0**answers

144 views

### Optimization problem involving Multivariate Normal

I use $\phi(t)$ to describe the standard normal distribution density and $\Phi(t)$ as the normal distribution CDF and would like to prove that for all
$n\geq3$, the function:
...

**2**

votes

**5**answers

229 views

### Distance between two sets

Let $A, B$ be two convex and closed subsets of $\mathbb{R}^n$. We would like to the minimum distance between these two sets. i.e., we want to find a solution for the following problem.
$$ \min ...

**0**

votes

**0**answers

77 views

### Complexity of turning a d-degree polynomial to 2-degree polynomial

For a very simple example,
$(1+x)^4=x^4+4x^3+6x^2+4x+1$ is a 4 degree polynomial, and I want to change it to a 2-degree polynomial by add more variables, for this example, we can simply let $y=x^2$, ...

**2**

votes

**2**answers

127 views

### How to minimize the Bregman divergence on a convex hull spanned from a set of vectors?

everyone.
It has been well known that the following minimization problem of a Bregman divergence with linear inequality
can be solved by successively projecting the current point to each constraint ...

**6**

votes

**0**answers

59 views

### Bounding volume of cell in complement of zero set

I am given an integer polynomial $f \in \mathbb{Z}[X_1, \ldots, X_n]$ of bounded degree and bounded coefficient size. The polynomial's zero set partitions $\mathbb{R}^n$ into cells. What I am looking ...

**5**

votes

**2**answers

285 views

### Can we decompose a polynomial into difference of convex polynomials?

Given a multivariate polynomial $p(x_1, ..., x_n)$ on $\mathbb{R}^n$, can we always decompose it into the difference of two convex polynomials? i.e., is there a pair of convex polynomials $f$ and $g$, ...

**0**

votes

**0**answers

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

**0**

votes

**0**answers

51 views

### What is the best way to optimize this matrix equation

What is the best way to optimize this Procrustes like formulation:
$\min\quad\|AX-B\|^2_{\rm F} + \|X^Tc\|^2,$
s.t. $X^TX = I$
Here A and B are $n \times p$ matrices and $c$ is a $p \times 1$ ...

**2**

votes

**0**answers

81 views

### Techniques for proving that a set of constraints over the integers are inconsistent

I have a problem which boils down to showing that a set of constraints has no solutions. A simplified version of this constraint system would be the following system:
$$
\left\{
\begin{array}{l}
...

**1**

vote

**0**answers

64 views

### Estimation of part of parameters from an ODE

Suppose, we have an ODE
$$ \frac{dy}{dt}= f(t,y;p',a)$$
or alternatively
$$ \frac{dy}{dt}= f(t,y;p)$$
where the set of all parameters $p = (p',a)$. We only need to estimate part of parameter set ...

**1**

vote

**1**answer

171 views

### How to find the necessary and sufficient conditions for a non-convex function to be locally convex?

Let $f(X)\geq 0$ be a nonconvex $C^\infty$ function: $\mathbb R^3\to \mathbb R$.
Give any fixed $X_0$ such that $f(X_0)=\epsilon^+$, and the level set:
${L}=\{X\in \mathbb R^3:f(X)\leq \epsilon^+\}$ ...

**0**

votes

**0**answers

24 views

### weakly Complementary slackness

Suppose we have a general pair of primal-dual semidefinite programming and strong duality holds.
What does mean the term "weakly Complementary slackness condition" in optimality?

**1**

vote

**1**answer

147 views

### Lagrange multiplier and semidefinite programming

suppose we have a primal semidefinite programming. for finding its dual we use Lagrange multiplier $w_i$ for each semidefinite constraint. If the Lagrange multiplier be zero for one constraint what we ...

**2**

votes

**0**answers

190 views

### Subtour Elimination in Travelling Salesman Problem using MTZ

I am trying to formulation a problem similar to a Traveling Salesman with Time Window constraints.
To eliminate subtours, I need to use some constraint similar to a generalization of MTZ constraints ...

**3**

votes

**2**answers

225 views

### Why eigenvectors optimize this orthogonally constrained nonlinear minimization problem?

Given a $p \times p$ positive definite matrix $\Sigma$, why eigenvectors of $\Sigma$, stacked as columns of a matrix $R \equiv [r_1 \, r_2 \, \ldots \, r_p]$, optimize the following orthogonally ...