# Tagged Questions

A non-linear optimization problem includes an objective function (to be minimized or maximized) and some number of equality and/or inequality constraints where the objective or some of the constraints are non-linear. Use this tag for questions related to the theory of solving such problems or for ...

27 views

### About finding the common diagonalizing similarity transformation.

Say I have $2k$ matrices $M_{a_1b_1}$, $M_{a_2b_2}$,..,$M_{a_kb_k}$ and their negatives. Here $M_{a_ib_i}$ is such that it has $0$ everywhere except that it has $1$ at $(a_i,b_i)$ and $(b_i,a_i)$ ...
54 views

### Find the critical point and show it is not a global minimizer (using Hessian)

Consider the function $f(x,y) = x^3 + e^{3y}-3xe^y$. Show that $f$ has exactly one critical point and that this point is a local minimizer, but not a global minimizer. I have attempted this, but it ...
26 views

### Is it possible to solve this 2D geolocation problem?

I have $N$ equations: $$R_i=\alpha_i\frac{T_i}{(x-x_i)^2+(y-y_i)^2}, i=1..N$$ $T_i>0$, $0 < \alpha_i < 1$ and so $R_i>0$. $R_i$, $x_i$ and $y_i$ are known quantities; $x$, $y$, $T_i$ ...
68 views

48 views

### Is it linear or nonlinear, time-invariant or time-varying?

The equation of motion can be expressed as $M(t)\ddot{q}(t) + D(t)\dot{q}(t) + K(t)q(t) = f(t)$ where $q(t)$ is the defection, $M(t)$, $D(t)$, and $K(t)$ are the mass, damping, and stiffness ...
52 views

### Maximizing a convex function under constraints

Consider the following non-convex problem: \begin{equation*} \begin{aligned} & \text{maximize} & & f(X) \\ & \text{subject to} & & f(X)\le b\\ &&& A_kX = c_k, \ k=...
14 views

### Distributing resource based on Efficiency

I am trying to form an optimization problem where I have $k$ nodes who transmits packets with rate $x_k$. The objective is to maximize the rate. $\hspace{28mm} \text{ Maximize } \sum_k \log x_k$ ...
23 views

35 views

30 views

### Optimization problem: solving one implies solving the reverse?

I am looking to solve an optimazation problem $Maximize_{x} [A(x)]$ s.t. $B(x)\geq B_0$, where $B_0$ is a constant. If I solve this problem (i.e, finding the optimal $x^*$ that optmize while ...
119 views

### Who knows Krotov's Method in Optimal Control Theory

I'm finishing my PhD thesis about applications of optimal control theory in the field of energy harvesting. In the course of my PhD I dealt with different ways to compute optimal controls, and I found ...
27 views

### How to Find the Maximum of a Function Represented by a Back-Propagation Neural Network?

First, I train a standard feed-forward neural network over a training set of data points. I get an approximate function, say $F(x)$, represented implicitly by that neural network. 1. How do I ...
34 views

### Placing Circles Onto Lines For Optimality

Suppose you have a yet to be determined number of vertical lines with length 50 on which you'd like to place as many circles as you can. Each circle is 10 units in diameter and its outside edge must ...
26 views

12 views

### Non linear Optimization for resource allocation

I want to maximize the sum rate of a wireless system while maintaining fair allocation by using fairness constraint. $R_k$ is the rate for each user. I have set up my objective function as : Maximize ...
48 views

### How are the tolerances evaluated in fmincon? specific/complete mathematical formulations needed.

I'm currently studying the stopping criteria about fmincon using different algorithms and I'm wondering how are the tolerances are actually evaluated and compared in the built-in function fmincon. ...
Optimization problem is to find $x$>0 which $min \ \ L=\frac{A\left ( B(\frac{C}{Cx-B}+\frac{1}{x})+2C\log(\frac{B}{x}-C) \right )}{B^3}$ $s.t \ \ x\leq K$ Rewriting the objective ...