All Questions
Tagged with nonlinear-optimization polynomials
25 questions
6
votes
2
answers
492
views
Does this polynomial have a real zero less than or equal to $1/2$?
Is the smallest root $x$ of
$$
10x^{3}-30x^{2}+\left(30-2\sum_{1\le i<j\le6}\cos^{2}\alpha_{ij}\right)x\\
+2\sum_{1\le i<j\le6}\cos^{2}\alpha_{ij}-\sum_{1\le i<j<k\le6}\cos\alpha_{ij}\cos\...
9
votes
3
answers
2k
views
Smallest root of a degree 3 polynomial
Is it true that the smallest root $t$ of the polynomial
$$
20 t^3 - 30 t^2 + (12 - 4 \cos^2 \alpha - 4 \cos^2 \beta - 4 \cos^2 \gamma) t + \cos^2 \alpha + \cos^2 \beta + \cos^2 \gamma - 2 \cos \alpha \...
1
vote
1
answer
100
views
Maximizing the ratio of multilinear polynomials
Consider two multilinear Polynomials $A(x_1,x_2,x_3,\dotsc,x_n)$ and $B(x_1,x_2,x_3,\dotsc,x_n)$ of $n > 2$ variables $x_i \in \mathbb{R}$ and their ratio
\begin{equation*}
F(x_1,x_2,x_3,\dotsc,...
2
votes
1
answer
196
views
How many strict local minima can a quintic polynomial in two real variables have?
A quadratic or cubic polynomial (in two variables) can have at most one strict local minimum. A quartic polynomial can have up to five strict local minima [1]. So, how many strict local minima can a ...
8
votes
1
answer
690
views
How many saddle points can a quartic polynomial in two real variables have? All 9?
By Bézout's theorem a quartic polynomial $p(x,y)$ can have at most 9 isolated critical points. Can all of them be saddle points?
In case of a cubic polynomial there is a mechanical way to answer this ...
7
votes
1
answer
1k
views
Can a cubic polynomial in two real variables have three saddle points?
Is there a cubic polynomial $c(x,y)$ with exactly 3 saddle point critical points?
In other words, can a cubic polynomial in two variables have three critical points, all of which are saddle points? ...
29
votes
1
answer
1k
views
Can a real quartic polynomial in two variables have more than 4 isolated local minima?
This question: "Can a real quartic polynomial in two variables have at most 4 isolated local minima?" came up in this post on Math SE but with no answer so far.
Finding examples of 4 ...
3
votes
1
answer
133
views
Is the smallest root of this quartic always the closest point on the Hyperbola? [closed]
Let $a>b>0$.
Suppose we want to minimize
$$
f(x)=(x-a)^2+(1/x-b)^2,
$$
over $x>0$.
Equating $f'(x)=0$ leads to the quartic equation
$$
g(x)=x^4-ax^3+bx-1=0. \tag{1}
$$
Question:
Is the ...
2
votes
1
answer
245
views
Using Nelder-Mead to solve system of polynomial equations
I am trying to solve a system of $9$ polynomial equations in $9$ unknowns over the non-negative reals.
Since the equations are quite large and I would like to use VBA, I prefer an algorithm that ...
4
votes
1
answer
155
views
Is there a point in 6-dimensional space satisfying these polynomial inequalities?
I would like to know if there is a point $(a, b, p, q, x, y) \in [0,1]^6$ satisfying the following collection of inequalities.
$b \ge a$
$q \ge p$
$y \ge x$
$a \ge p \ge a^2$
$b \ge q \ge b^2$
$p \ge ...
1
vote
1
answer
234
views
Constrained optimization of sum of squares polynomials
Consider the problem
$$
\min p(x) \text{ subject to } g_j(x)\le 0
\quad
p,g_j\in\text{SOS},
\qquad
(*)
$$
i.e. $p,g_j$ ($j=1,\ldots,m$) are sum of squares (SOS) polynomials. Can this problem be ...
2
votes
1
answer
150
views
Non-negativity condition for special quartic
I know that a necessary and sufficient condition for the positivity of a quartic polynomial of many variables is in general difficult. I have a somewhat special case, maybe here more can be said. Let $...
1
vote
1
answer
146
views
Omitting constraints of polynomial system
Let $n_1, n_2 \geq 1$ be known integer constants.
Suppose that we have the following system of $n$ polynomial inequalities
for which we know that there exists a feasible solution $(p_1, p_2) \in (0,1)...
2
votes
1
answer
202
views
Feasibility of constrained multivariable diophantine equations
Let $d$ be day, $m$ be month and $y$ be year fields of a date. I want to find few dates of format
$$(d^2\, mod\,\, 2 + (my + d^3) \,mod \,4) = 2$$
Is there a method to solve this type of equation or ...
7
votes
1
answer
313
views
Surprisingly simple minimum of a rational function on $\mathbb R_+^n$
Motivation:
The following problem has occurred in a study of energy dissipation in a chain of coupled, damped oscillators.
The problem:
Let me define specific rational functions $f$, $g$, and $...
6
votes
0
answers
255
views
Concavity of a function implicitly defined by a polynomial
Consider the following system of $n$ equations:
\begin{equation}f_j^2 = x_j^2\sum_{i=1}^n A_{ij} f_i
\tag{$\star$}
\end{equation}
where $A_{ij}\geq 0$ are known constants and where $x_j>0$ for ...
4
votes
2
answers
672
views
Difference between Chebyshev first and second degree iterative methods
Consider linear equation $Au = f$.
We want to solve it with iterative method (assuming $A$ is good).
First order iterative method is:
$$
u^{k+1} = u^k - \alpha_{k+1}(Au^k - f),
$$
The second degree ...
1
vote
1
answer
179
views
Why polynomial $\psi^\top(t) A^{-1} \psi(t)$ attains maximum on $[-1, 1]$ at $t = \pm 1$, where $\psi_k(t) = t^k$?
Problem. Let $\psi(t) = (1, t, t^2, \ldots, t^{p-1})^\top$ - a polynomial basis.
Suppose there is a matrix
$$
A = \int_{-1}^1 \psi(t) \psi^\top(t) dt, \ \text{i.e. } \ A_{ij} = [2 \, | \, i+j] \...
2
votes
0
answers
128
views
How to approximate higher-degree multivariate polynomial in space of lower-degree multivariate polynomials with some constraints?
For a polynomial $P_{1}(x)$, $x\in {\mathbb R}^n$ with a higher-degree, how to find a lower-degree polynomial $P_{2}(x)$ with determined structure or bounded degree to approximate it with the ...
0
votes
1
answer
87
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
$$\sum_{i=1}^{k}\left[-4a_{i}^{3}+\left(3n-...
7
votes
3
answers
698
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 ...
0
votes
0
answers
91
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$, ...
6
votes
0
answers
77
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 ...
6
votes
2
answers
718
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$, ...
7
votes
1
answer
422
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 ...