Questions tagged [nonlinear-optimization]
Nonlinear objectives, nonlinear constraints, non-convex objective, non-convex feasible region.
7 questions from the last 30 days
0
votes
1
answer
90
views
How to calculate the maximum dimensions of a rectangle inside two concentric circles? [closed]
If I have a rectangle ABCD such that A and B touch two points of the outer circle and CD's touches one point of the inner circle, how could the maximum dimensions of the rectangle be calculated?
...
- 17
1
vote
0
answers
78
views
Markov Chain that maximises the entropy creation rate
I am working on MERW (Maximal entropy random walk) for a project.
I want to show that given a graph G, there is $\textbf{only one}$ aperiodic markov chain on G that maximises the entropy creation rate ...
- 11
1
vote
0
answers
29
views
Change in active constraints when perturbing the objective of a QP
Suppose I have a quadratic program (with positive semidefinite cost matrix) with affine (polytopic) constraints. It is known that the solution to this is piecewise affine, with the ``pieces'' defined ...
- 11
0
votes
0
answers
37
views
Maximise norm over the boundary of a convex set
Let $K\subset \mathbb R^2$ be compact, convex and connected. What is the know numerical scheme to find the extremal points of $K$?
Denote by $\partial K$ the collection of all extremal points of $K$. ...
- 1,389
3
votes
0
answers
144
views
An optimisation problem
Let $E\subset \mathbb R^2$ be compact, convex and connected. For $p_1,\ldots, p_n>0$ with
$$\sum_{i=1}^n p_i=1,$$
and a probability measure $\nu$ supported on $E$ of density $f$, we consider
$$\...
- 1,389
0
votes
0
answers
22
views
Alignment of unit vectors under graph-neighbor constraints with a global vector
Statement
Let $G = (V, E)$ be a connected, unweighted, and undirected graph with $n$ nodes, represented by its adjacency matrix $A$. Suppose each node $i$ is associated with a unit vector $ \mathbf{v}...
0
votes
1
answer
60
views
Optimizing sum of discrete minimum
Please consider the following optimization problem: Given a fixed positive natural $n < N$, and a set of functions $f_i$ over a finite domain of nonnegative outputs, s.t. $1 \le i \le N$, then we ...
- 103