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
16 views

Solving the quadratic optimization problem with quadratic inequality constraint

I have a quadratic optimization problem which which both objective function and constraint are convex. As the problem is very big, I used decomposition technique and divide the problem to smaller ones ...
0
votes
0answers
25 views

Solving constrained linear programming problem

I have variables $t$ and trying to find best multipliers $k$ which minimizes my objective function. Time: $t_1$, $t_2$, $t_3$,... given in input Multiplier $k_1$, $k_2$, $k_3$,... (These are ...
0
votes
0answers
12 views

Reducing uncertainty of a mathematical model with data (Process control)

I know this is a very broad question, but need suggestions, link to good reference papers etc. So here is the question: I have an uncertain model whose parameters are static (not changing with time) ...
0
votes
0answers
10 views

Analysis of Optimizatiointechniques: Regret Analysis vs. Direct convergence? [on hold]

When it comes to convergence rate analysis of optimization algorithms (like gradient descent and its family), there seems to be to be two main: Direct analysis, i.e. bound on $$ |f(x_t) - f(x^*)| ...
0
votes
1answer
16 views

Explanation of $\textrm{argmax}_j{z_jt}$ and how to implement it

I'm struggling with one equation within a subtour elimination constraint. $$\sum_{i \in S} \sum_{j \in S, j<i} y^t_{ij} \le \sum_{i \in S} z_{it} -z_{kt} \quad S \subseteq M \quad t \in T \quad ...
0
votes
0answers
20 views

joint optimization problem with somewhat symmetric function

I have just brief question that the method that I use to solve optimization problem is legit. I have function $\max_{x,y}F(x,y)$, and first order condition gives me following equation. ...
0
votes
1answer
35 views

MATLAB: minimize function using x value from previous iteration

I'm trying to develop an algorithm for a proximal point method defined as: $$ \underset{x \in \rm I\!R^n}{\arg\min} f(x) + \lambda g(x) $$ where f(x) is a convex and coercive function and also ...
0
votes
0answers
19 views

Find $\alpha$ from equation $F(\alpha)=\int \left (\frac {I(x)}{\alpha^TG(x)}-1\right)^2 \, dx+\lambda\|\alpha\|^2$

I have a function such as $$F(\alpha)=\int \left (\frac {I(x)}{\alpha^TG(x)}-1\right)^2 \, dx + \lambda \|\alpha\|^2$$ where $I,\lambda,G$ are given. In which $G(x)$ is a vector; $G=[G_1(x), G_2(x), ...
0
votes
0answers
15 views

Help required in solving the lagrangian dual?

I'm trying to write the Lagrangian dual to the following problem \begin{align*} (P) \quad \min\;&\text{Trace}(CG)\\ \text{s.t.}\;&G \succcurlyeq 0\\ & G_{i,i}=I_d (i=1,..,M+1)\end{align*} ...
-3
votes
0answers
10 views

How to get attribute weights from a tradeoff? [closed]

Assume that we are getting oranges and apples from a fruit basket, getting apples is seen more important than oranges, and the outcome of x=(0 apple, 25 oranges) is equally preferred as x=(10 apples,0 ...
0
votes
0answers
5 views

If $d^k$ is a descent direction for $f(x^k)$, then $\nabla f(x^{k+1})^t d^k=0$, where $x^k+1=x^k+\alpha^k d^k$

I have solved this problem but got something slightly different. My professor is notorious for his typos in half of the examples, so I was wondering if this is just another typo or if I got it wrong. ...
0
votes
0answers
27 views

Convert a nonconvex function to convex function

I have a image $I: \Omega \to \Bbb R$. It is separated into 2 non-overlapping region: $D$ and $\Omega \setminus D$ Each point $x$ in the image $I$, the $\phi$ function is defined as: $$\phi(x)= ...
0
votes
0answers
14 views

Justifying the “Dual feasibility”, one of the Karush-Kuhn-Tucker conditions

I am having difficulty of interpreting the KKT conditions in a general setting where we have $M$ equality and $N$ inequality constraints defined as: Minimize $f(x)$ subject to $g_i(x) \leq 0 , h_j(x) ...
0
votes
2answers
31 views

Quite rare kind of proof of convexity for a quadratic function!

Excuse me all of you in advance. I got this problem as an assignment but I am not really good doing proofs! If $f(x)=\frac12x^TQx+b^Tx+a$ is quadratic in $n$ variables, where $Q$ is symmetric. Show ...
1
vote
1answer
39 views

Why does $\frac{\textbf{g}^T\textbf{d}}{\textbf{d}^T\textbf{H}\textbf{d}}$ give the maximum of function $\mathcal{D}(\textbf{x}+\lambda\textbf{d})$

Let say I have to find the value $\lambda^*$, that maximizes the following quantity: $$\lambda^*=\underset{\lambda\in \Lambda}{\text{arg max}}\;\;\mathcal{D}(\textbf{x}+\lambda\textbf{d}),$$ ...
0
votes
1answer
22 views

What is the approach to solve simple constrained optimization when first order condition $\nabla f = 0$ yields solution outside of domain

I wish to solve the problem min $ f(x_1, x_2) = x_1^2 - x_1 + x_2 + x_1x_2$ subj $x_1\ge 0, x_2 \ge 0$ We find $\nabla f = [2x_1 - 1 + x_2, 1+x_1] = 0$ yields $x_1 = -1, x_2 = 3$ which is outside ...
-2
votes
0answers
52 views

Maximum of inner product

The question is to maximize $\langle a, x\rangle$ subject to $\langle b, x^2\rangle = 1$ where $a$, $b$ and $x$ are positive $n$-dimensional vectors in $\mathbb R$, and $\langle\cdot,\cdot \rangle$ is ...
0
votes
0answers
8 views

Find $\min \sum_{1\le i\le n} x_i\mathbf{z}^T\mathbf{A}\mathbf{y}_i +\mathbf{b}^T\mathbf{x} +\cdots$

I have been stuck at this problem for a while :( Given $\mathbf{A}\in\mathbb{S}^{p\times p}, \mathbf{A}\ge 0,\mathbf{A} \text{ symmetric}, \mathbf{b}\in\mathbb{R}^n,\mathbf{c}_i\in\mathbb{R}^p\forall ...
1
vote
0answers
18 views

Why steepest descent gives a wrong direction search?

I have to minimize the function $ƒ(x_1,x_2)=(x_1-1)^2+x_2^3-x_1x_2$. The initial point is $[1,1]^T$. The gradient of this function is $∇ƒ(x_1,x_2)=[2(x_1-1)-x_2,3x_2^2-x1]$. This gradient evaluated ...
0
votes
0answers
25 views

Karush-Kuhn-Tucker conditions for non-linear optimalization

I have the following problem: solve the local conditions (KKT) and find ALL optimal solutions: $$\min f(x,y)$$ subject to $$g(x,y)\le 0$$ $$x\geq0, y\in\mathbb{R}$$ I have some questions to this ...
1
vote
1answer
33 views

(half) hyperboloid least squares problem

I have five equations as follows, , where i = 1, 2, 3, 4, 5 and only (x, y, z) are unknown. The five equations above are half-side hyperboloids. It could be seen as . I want to find the solution (x, ...
1
vote
1answer
48 views

How to project gradient vector to subspace defined by linear constraints

I have the following set of linear constraints: $$\begin {align}\textbf{y}^T\textbf {x} &= 0 \\ \textbf {0} &\leq\textbf {x} \leq C\cdot\textbf {1},\end {align}$$ where $\textbf {y} \in ...
0
votes
0answers
27 views

what kind of optimization is this?

I have an optimization problem that looks like this: \begin{array}{cc} min & x'\varSigma^{2}x+k^{2}e'e-2ke'\varSigma x\\ s.t. & x'\varSigma x=ke'x\\ & ...
0
votes
1answer
28 views

How to find Parameters in nonlinear Regression Model?

I have a nonlinear Regression Model with eleven observations of $x,y$. How do I find the parameters $a,b,c,d$ of the model: $ y=f(x)=a + b \sin cx e^{dx}$ by using the function: $$\Phi(a, b, c, ...
0
votes
0answers
12 views

Newton method/ellipsoid norm [closed]

I was reading in that English maths book about newton methods, then I found the expression "ellipsoid norm" , I didn't get it , Does it mean the infinity norme or any Lp norme ? Please answer me as ...
0
votes
0answers
15 views

How to find parameters from logistic equation

I have an function and assume that that is convex function. I want to use gradient decent to find parameters in that equation. Could you suggest to me the way to do it. Thanks. This is my function ...
1
vote
0answers
10 views

Optimization with Integral Inequality constraint and nonnegativity conditions

Trying to solve this: $$\min TC(A,a,q)= \int_M f(A,a,q)\,dx\, dy$$ $$s.t.$$ $$a\le\int_M g_i(A,q)\,dx\,dy$$ $$q\le \text{constant}$$ $$A,a,q\ge0$$ $(x,y)$ is omitted in $A(x,y), a(x,y), q(x,y)$ ...
0
votes
0answers
12 views

Plotting Non Linear Programming functions

I define these functions in Matlab: ...
0
votes
1answer
24 views

How to determine the optimal step size in a quadratic function optimization

I have the following optimization problem: $$\underset{\alpha\in\mathbb{R}}{\text{min}}:\;\;f(\textbf{x}+\alpha\textbf{d})$$ $$\text{subject to}:\;\;0\leq\alpha\leq \alpha_{max},$$ where ...
0
votes
0answers
23 views

How do I convert a constraint with a product of two integer variables to a linear constraint?

I have a constraint of the form: $$\theta \leq a_1x_1 + a_2x_2 + a_3x_1x_2$$ where, $x_1$ and $x_2$ are integer variables with ranges $x_1 \in \{0, m\}$ and $x_2 \in \{0, n\}$. I would want to ...
0
votes
3answers
38 views

ADMM formalization

I found lots of examples of ADMM formalization of equality constraint problems (all with single constraint). I am wondering how to generalize it for multiple constraints with mix of equality and ...
1
vote
0answers
15 views

Do quasi-Newton methods check the second-order optimality condition?

I have a practical question about quasi-Newton methods. In quasi-Newton methods, Hessian matrix is approximated. It seems to be impossible for them to check the second optimality condition. In ...
0
votes
1answer
22 views

How to find optimized value of two variables

I have two variables: $\kappa_y$ and $\kappa_x$ And three functions: $M_y$=$M_y$($\kappa_y$, $\kappa_x$) $M_x$=$M_x$($\kappa_y$, $\kappa_x$) $F_z$=$F_z$($\kappa_y$, $\kappa_x$) All these three ...
2
votes
2answers
38 views

Why a convex cone cannot have more than one extreme point?

The way I define an extreme point is : A point which cannot be defined as a convex combination of two distinct points. I'm not able to extend this and show why a convex cone cannot have more than ...
1
vote
0answers
27 views

Why Was Backprop Invented?

I'm currently researching artificial neural networks and I keep wondering why do we use "backpropagation" to train a neural network. An ANN is basically just a very large and complex function ...
0
votes
0answers
36 views

Lagrange multiplier method

Question 1: Could somebody please refer me to an introduction to Lagrange multipliers which is easy to read but still in full generality? Question 2: I am interested in particular in the following ...
1
vote
1answer
24 views

How can I compute fast the minimum of a linear plus Kulback-Leibler on the unit simplex?

Given $a, x^0 \in \mathbb{R}^n$ I wish to compute $$\min_{x \in \Delta_n} a^t x + \sum_{i=1}^n x_i\log(x_i/x^0_i) - x_i +x^0_i $$ where $\Delta_n$ is the unit simplex $\{x \in \mathbb{R}^n \mid ...
1
vote
1answer
32 views

Gauss-Newton Non-Linear Squares Optimisation

I doubt this is solvable at all, but I thought I will give a try. Essentially I am trying to extend Gauss-Newton algorithm to 2nd Taylor term. ...
0
votes
0answers
19 views

Book on duallity and sensitivity in nonlinear optimization

I am looking for a recommended book on duallity and sensitivity in nonlinear optimization, as duallity and sensitivity is a well studied topic in LP , I am struggeling to find books in this subject ...
0
votes
0answers
15 views

Maximize a concave function under nonconvex constraints

I have to maximize the rate, which is a concave function, under certain constraints, where one of them is not convex; My optimization problem is: $\max_{\mathbf{P}_{2,n}} \frac{B}{L} \sum_{k=1}^L ...
0
votes
1answer
15 views

How do I know that method of steepest descent works?

Here is the definition of the method of steepest descent given in the book "The mathematics of nonlinear programming" by Peressini. Suppose $f(x)$ is a function with continuous partial derivatives on ...
0
votes
0answers
26 views

Global stochastic maximization of a multi-parameter function

I have a function $F:\mathbb{R}^n\to[0,1]$ such that $$ F(\lambda) = \mathbb{E}_x[f(\lambda;x)] = \int f(\lambda;x)\mu(x)dx,$$ and I want to find $\tilde\lambda$ that maximizes F, i.e. ...
0
votes
0answers
22 views

Solving Nonconvex Programming using Genetic Algorithm

Consider such a programming problem, \begin{equation} min \| \Psi(\boldsymbol{x}) \|_p \quad s.t. \quad \boldsymbol{Ax} = \boldsymbol{b} \end{equation} Where $\boldsymbol{x} \in \mathcal{R}^{n}$, ...
4
votes
1answer
44 views

How to maximize $\sum\limits_{i=1}^n u_iln(x_i)$?

How to maximize this? $$ \sum\limits_{i=1}^n u_iln(x_i), $$ where $u_i,x_i$ are real numbers, $n$ is a positive integer, $0 \leq u_i \leq 1, 0 < x_i < 1, \sum\limits_{i=1}^n u_i = 1, ...
3
votes
1answer
76 views

No clear analytic method to prove unique maximum? ($2^{-x}+2^{-1/x}$)

Prove that $f(x) = 2^{-x}+2^{-1/x}$ has the unique local maximum $(1,1)$ for $x>0$. Do not use computer software. Proving that $(1,1)$ is a maximum is easy, but I'm having trouble with the ...
1
vote
0answers
29 views

How to prove a solution is indeed a constrained minimum?

I'm reading the following example on Heath's Scientific Computing (page 266, second edition if anyone has it). "Minimize $f(x_1,x_2)=2\pi x_1(x_1+x_2)$ subject to $g(x_1,x_2)=\pi x^2_1x_2-V$" ...
0
votes
0answers
17 views

Linear programming (or possibly nonlinear) formulation

The problem is like this; The construction company is considering erecting three office buildings. The time required to complete each of them and the number of workers required required to be on the ...
1
vote
0answers
43 views

Epsilon constraint method - Pareto optimal solution representation

There's a course that I do remotely and I have a homework question which I have no idea how to answer. I did look up a lot in google and did not find any good examples - only loads of information and ...
1
vote
1answer
40 views

Non-uniqueness of worst-case (max-min or min-max) optimization

I have a worst-case optimization problem, where i want to maximize the minimum from the uncertainty set (uncertainty is given as an ensemble of 100 realizations, so an ensemble based approach). It is ...
0
votes
0answers
9 views

Can this equation have an explicit solution?

Given $n > 0$, $0 \leq i \leq n$ is an integer, $D = diag(d_1, \dots, d_n)$ is positive definite, $e_i$ is the $i$th column of a $n \times n$ identity matrix, $u \in R^n$ such that $B = D + u * ...