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

learn more… | top users | synonyms

0
votes
0answers
8 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)$ ...
0
votes
0answers
21 views

How i obtain this demand function? [on hold]

The utility function is this $$∑_{i=1}^n \frac{β_i}{α}\left( \frac{x_i-γ_i}{β_i }\right)^α$$ subjet to $$∑_{i=1}^n p_j x_j =y$$ The primer orden conditions are $$\left( \frac{x_i-γ_i}{β_i ...
3
votes
1answer
26 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 ...
1
vote
0answers
18 views

Intuitive meaning of “Primal Dual Interior Point Method” [on hold]

I am trying to understand how "Primal Dual Interior Point Method" works for nonlinear optimization. I have seen some examples already. Wikipedia has a very good example too. But I am still finding it ...
0
votes
1answer
12 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$ ...
0
votes
0answers
29 views

Local global minimizers and maximizers

I want to find the local and global minimizers and maximizers of the following two functions. 1) $f(x)=x^2e^{-x^2}$ 2) $f(x)=x+ \sin x $ These are my answers. 1) $f(x)=x^2e^{-x^2}$ ...
0
votes
3answers
24 views

Global Optimization of a well-defined function with gradient information

I try to minimize the function $$ f(x_1, …x_n)=\sum\limits_{i}^n-a_icos(4(x_i-b_i)) +\sum\limits_{ij}^{edge}- cos(4(x_i-x_j)) $$ $$x_i,b_i\in (-\pi, \pi)$$ where $\sum\limits_{ij}^{edge}$ only sums ...
0
votes
0answers
37 views

Minimum of the sum of two functions

I want to show that trying to find the minimum of the sum of two or more functions of two different groups is a not convex problem. For example: $ \min\limits_{Y,Z} f(X,Y,Z)=...$. Moreover the values ...
0
votes
1answer
19 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 ...
1
vote
1answer
26 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, \ ...
0
votes
0answers
12 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$ ...
0
votes
0answers
12 views

Sufficient conditions for an optimization problem

Given an optimization problem \begin{equation} \max{F(x)} \text{ subjected to }T(x)=u \end{equation} Where $F:\mathbb{R}^n \rightarrow \mathbb{R}$ is concave function and $T:\mathbb{R}^n ...
2
votes
0answers
13 views

variable transformation in optimization

I have an optimization problem with two sets of parameters, $x_i \in [0,1]$ and $y_k \in [-\frac{\pi}{2},\frac{\pi}{2}]$ where $i,k \in \{1...n\}$ are indices. One way to solve this problem is using ...
0
votes
0answers
36 views

Solving Nonlinear System for two variables

I have an optimization like below: $\text{ minimize } \sum_k - w_k\log_2 x_k $ $\text{subject to: } x_k \leq q , k =1,2, \cdots, N .$ $\hspace{20mm} 0 \leq w_k \leq 1$ I can form the Lagrange ...
4
votes
0answers
99 views

When is the Lagrangian dual function smooth?

Consider a nonlinear optimization problem of the form \begin{align} \min_{x}&\quad f(x)\\ \nonumber \text{subject to } \quad&h_i(x) = 0,\,i=1,\ldots,I\\ \nonumber \quad&g_j(x) \le ...
0
votes
1answer
30 views

Finding KKT conditions for nonlinear optimization problem.

I have an optimization like below: $\text{ minimize } \sum_k - \log_2 x_k $ $\text{subject to: } x_k \leq q , k =1,2, \cdots, N .$ I can form the Lagrange of the problem as below: $L(x, ...
0
votes
0answers
16 views

Solving Nonlinear system with logarithmic objective function

I have my objective function as : $\hspace{25mm} \text{Minimize} \sum_k- \alpha_k \log_2 W_k$ $\hspace{25mm} \text{subject to}: 0\leq W_k \leq q', 0 \leq \alpha_k \leq 1 $ $\hspace{25mm} k ...
0
votes
1answer
50 views

How can I solve a nonlinear optimization problem where constraint contains exponential term?

I have the optimization problem as below: $\hspace{10mm} \text{Maximize} \sum_{k} \alpha_k {R}_k $ $ \hspace{10mm}\text{subjcet to:} $ $ \hspace{10mm}\exp \left[ - (2^{{R}_k } -1) \left( ...
0
votes
0answers
17 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 ...
1
vote
0answers
27 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 ...
0
votes
0answers
12 views

Finding 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. Now I want to find ...
0
votes
0answers
13 views

$\left\{x^k\right\}$ converges to $x^*$ superlinearly iff $\left\|\nabla^2f(x^k)^{-1}\nabla f(x^k)+x^{k+1}-x^*\right\|=o(\left\|x^{k+1}-x^*\right\|)$

Let $(x^k)_{k\in\mathbb N}\subseteq\mathbb R^n$ be convergent to $x^*$. We say, that the convergence is superlinear iff $$\left\|x^{k+1}-x^*\right\|=o\left(\left\|x^k-x^*\right\|\right)\tag{1}\;.$$ ...
0
votes
1answer
29 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 ...
0
votes
0answers
13 views

constrained optimization including sum of two upper incomplete gamma function in both fitness function and constraint

i'm trying to solve this constrained optimization problem the constraint is $$\zeta=\frac {\Gamma \left(M,\frac {\lambda}{\left |\sum_{i=1}^Nw_i*h_{ei} \right|^2 + \sum_{i=1}^N\left |w_i \right|^2} ...
4
votes
0answers
38 views

Solving non-linear equations in a chosen subspace

I'm trying to find the root $\mathbf{f(x)=0}$ to the following sets of equations $$ f_1(x,y,z) = x^\prime - \frac{x}{\sqrt{x^2+y^2+z^2}} = 0 \\ f_2(x,y,z) = y^\prime - \frac{y}{\sqrt{x^2+y^2+z^2}} = ...
0
votes
0answers
7 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 ...
0
votes
0answers
19 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. ...
1
vote
0answers
41 views

May be a trivial question regarding constrained optimization

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 ...
0
votes
0answers
33 views

Optimize $\max _{x_1,x_2,…,x_N} N , \text{ s.t.} \sum_{i=1}^N f(x_i) \le a$

$Is there general theory for solving optimization problem of the following kind \begin{align} &\max _{x_1,x_2,...,x_N} N \\ \text{ s.t.}& \sum_{i=1}^N f(x_i) \le a\\ &\sum_{i=1}^N g(x_i) ...
0
votes
0answers
40 views

How to find values of non linear equations / system and solve for given values

I'm trying to find the value for the variable phase in a equation / system if amp=0.5 and freq=2.5 (note: i'm looking for several different phase values given amp and freq but this is a small ...
5
votes
1answer
106 views

Duality theory and nonlinear optimization

I have been studying nonlinear optimization recently and have come across some results that I need clarification for. I will do my best to explain them in detail below, providing citations where ...
1
vote
0answers
32 views

Need help using matlab optimization tools [closed]

I'm working on some project involving large scale matrix and i need your help to solve an optimization problem with matlab, the problem is the following: $ \min_L \{\alpha Tr(Y^{t}LY) + ...
0
votes
0answers
16 views

Solving linear objective functions with linear and non linear constraints

Is it possible to use Matlab commands intlinprog and fmincon to solve a linear programming problem with a linear objective ...
1
vote
0answers
9 views

Consider $x = A[v]_+ + B[-v]_+$, under what conditions on A & B is there a solution v for every x

Consider the vector equality $$x = A[v]_+ + B[-v]_+$$ where $[v]_+$ is the elementwise rectifier function, i.e. $$[x]_+ = \begin{cases} x &\mbox{if } x > 0, \\ 0 & \mbox{otherwise}. ...
0
votes
1answer
27 views

How to solve this matrix equation? Does the solution have a closed-form?

I am trying to find solution $X \in SO(3)$ for this matrix equation. $$PX - XQ + YXZ = K$$ where matrices $P, Q, Y, Z, K \in\mathbb{R}^{3\times3}$ are known. At the first glance, it does not seem to ...
0
votes
0answers
28 views

When exactly are quadratic objective functions polynomial time solvable

I'm considering quadratic programming problems of the form: $$ \max x^tQx+Bx$$ subject to the linear constraint $$ Ax \le b $$ I read that if is the case that $$ x^tQx + Bx \ge 0 \ \forall x$$ or ...
1
vote
0answers
24 views

Does a zero duality gap imply global optimality?

Let's say we are given a nonlinear optimization primal problem (P). Suppose that the dual problem (D) to the primal optimization problem (P) achieves a zero duality gap with a solution to the primal ...
0
votes
1answer
16 views

One definition of strong convexity (from textbook of Prof. Bertsekas in 2015)

In strong convexity, there are a few definitions, one of them is: $f$ is strongly convex over $\mathcal{C}$ with coefficient $\sigma$ if $\forall x,y \in \mathcal{C}$ and all $\alpha \in [0,1]$, we ...
1
vote
1answer
18 views

Is it possible to make a linear reformulation?

The question is what to do when we have a product of the three variables, quite different in their nature. One is binary, the second is real, and the third is from a discrete set of rational numbers. ...
0
votes
1answer
19 views

Question about least square allocation of an amount to different buckets.

Suppose we have to allocate $x$ amount to $k$ desired amounts. Is there algorithm to do this that minimizes the squared distance between the actual $k$ allocated values and the $k$ desired amounts? ...
0
votes
0answers
30 views

Optimization problem involving semidefinite matrix variable that is constrained to be a tensor product

I would like to solve the following optimization problem. With scalar $R$ and nine (mutually orthogonal) $9$-dimensional column vectors $\vec v_i$ all given ($\vec v_i\!'$ is the row vector Hermitian ...
0
votes
1answer
53 views

Find the minimum of a function for only positive values of the vector variable

Let variable vector $\vec{q}$ of size $m\times1$, and its diagonal counterpart $m\times m$ matrix $Q=diag(\vec{q})$, for some $m\in\mathbb{N}$. Define fixed parameter $n\times1$ vectors $\vec{p}, ...
0
votes
0answers
20 views

Relaxation of non-convex QCQP with one quadratic and one linear constraint

According to Boyd we know that a non-convex QCQP problem with one quadratic constraint has strong duality with the relaxed SDP or Lagrange counterpart. (check "Convex Optimization" by Boyd, Appendix ...
0
votes
1answer
28 views

A question about a proof in nonlinear programming book

I have a question about the proof of Proposition 1.2.1 (Stationarity of limit points for gradient methods) in the nonlinear programming book (2nd edition) by Bertsekas. At the beginning of the proof ...
3
votes
2answers
36 views

Distance between a plane and set of points

Suppose $m$ data points belonging to a class represented by matrix $A$. Therefore, the size of matrix $A$ is $m\times n$. In addition, suppose $w\cdot x + b=0$ be equation of a plane in ...
3
votes
0answers
72 views

If this problem is not unbounded, what's wrong in this dual derivation?

In a paper with 100 citation, Robust Support Vector Machine Training via Convex outlier Ablation, a convex relaxation is used. In this paper, a form of robust svm proposed: \begin{align} \min_{0\leq ...
1
vote
1answer
35 views

Function Optimization

Assume any recursive function like: (just for example, my rekursive function is just too big to write) $x_{n+1}=\frac{(x_{n}-3)^{5}x_{n}^{2}}{a\sqrt{x_{n}}}$ (or any other non-linear function) Is ...
0
votes
0answers
18 views

finite differences nonlinear least squares

I am facing to following nonlinear least-squares problem: $$\min_{u,\gamma} \frac{1}{1000} \int_{ \gamma(x,y)^2} + \int_{ [u(x,y)−u (x,y)]^2} + \int_{ [∆u(x,y)−\gamma(x,y)u(x,y)]^2}$$ where the ...
1
vote
0answers
16 views

How to solve the fractional polynomial optimization problem?

The optimization problem has a fractional of polynomials as the objective function, with linear constraint. For example, $\min\limits_{x,y}\quad ...
0
votes
1answer
29 views

Gradient of a sum of indicators

Say I have a function $\mathbb R^n \rightarrow \mathbb R$: $$f(w_1,\ldots,w_n) = n^-\sum_{i\in I^-}w_ix_i$$ with fixed $x_i\in\mathbb R$ (data), $I^-$ the set of indexes with negative sum operands ...