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

18
votes
2answers
518 views

Maximizing curious symmetric function from simple combinatorics

A curious symmetric function crossed my way in some quantum mechanics calculations, and I'm interested its maximum value (for which I do have a conjecture). (This question has been posted at ...
11
votes
1answer
384 views

Bidding Tic Tac Toe

In regular tic tac toe, both the players get alternate chances. This is a variant of that. Player $A$ has $\$x$ amount and player $B$ has $\$y$ amount as initial balance. Assume that $y>x$. Both ...
9
votes
2answers
451 views

A numerical optimization problem with a convolution in the constraint

I have a problem of the following form: minimize $\|Dx\|_2$ subject to $\|x*x\|_2 = 1$ where $x\in\mathbb R^n$, $D$ is a given diagonal matrix of positive entries, and $*$ represents convolution, ...
8
votes
3answers
457 views

Optimization problem for a parity-check code

I have $n$ data blocks and $k$ parity blocks distributed across $m$ boxes where each box can contain atmost $b$ blocks. Each parity block is Ex-or of some data blocks (for ease of understanding we can ...
8
votes
1answer
312 views

Minimization of $\sum \frac{1}{n_k}\ln n_k >1 $ subject to $\sum \frac{1}{n_k}\simeq 1$

Looking at an algorithm for minimizing $\sum_{k=1}^{m} \frac{1}{n_k}\ln n_k > 1$ subject to $\sum_{k=1}^{m}\frac{1}{n_k} = 1$ in which $n_k$ are positive and in general non-sequential integers, I ...
7
votes
7answers
6k views

Operations research book to start with

for somebody having a quite strong background in Mathematics, which are some good books for the domain of Operations research? I guess there are textbooks covering topics like linear and nonlinear ...
7
votes
1answer
3k views

The composition of two convex functions is convex

Let $f$ be a convex function on a convex domain $\Omega$ and $g$ a convex non-decreasing function on $\mathbb{R}$. prove that the composition of $g(f)$ is convex on $\Omega$. Under what conditions is ...
7
votes
2answers
289 views

Are all non-convex problems created equal?

The distinction between convex and non-convex problems is usually dubbed as the distinction between easy and hard problems. While in the convex case you are golden (local optima are global optima; ...
7
votes
2answers
306 views

How to solve mixed integer nonlinear programs?

I'm not a math expert so sorry for possible trivial questions. I have written this mixed integer nonlinear program (MINLP): $$ \begin{align} \min & \sum_{i \in ...
7
votes
1answer
253 views

$\max\min$ problem

Suppose there is a real valued function $f(x,y)$ where $x,y$ are vector variables $x\in\mathbb{R}^n$ $y\in\mathbb{R}^m$. Moreover $f$ is strictly/concave in $x$ and strictly/convex in $y$. $f$ is also ...
7
votes
0answers
157 views

Consider the problem minimize $f(x)= x^4 −1. $

I am studying for a test and I found this problem in the textbook that I'm using, there may be a conceptual problem that I'm coming across. My test is on unconstrained optimization (multi-variable) ...
6
votes
4answers
1k views

Summary of Optimization Methods.

Context: So in a lot of my self-studies, I come across ways to solve problems that involve optimization of some objective function. (I am coming from signal processing background). Anyway, I seem to ...
6
votes
1answer
116 views

How is the Lagrangian related to the perturbation function?

Given a convex programming problem $$\begin{align*} \text{minimize} &\quad f(x) &\\ \text{such that} &\quad g_i(x) \leq 0 & i=1\dots k\\ & \quad h_j(x) = 0 & j= k+1\dots n ...
6
votes
3answers
848 views

Finding good approximation for $x^{1/2.4}$

I would like to a good (8 bits accuracy) approximation for $x^{1/2.4}$ in the range $[0, 1]$. This transform is used for converting linear intensities to SRGB compressed values, so it's important that ...
6
votes
1answer
238 views

Is duality theory in optimization as useful as it seems?

I have been reading a lot about nonlinear optimization and duality, and it seems that duality theory is extremely useful. I feel that I am missing some of the negative aspects/difficulties associated ...
6
votes
0answers
230 views

I need help about some compactness arguments

I need help to find some compact sets for my engineering problem. Through this page I learned quite much about it however since I have neither read a book yet nor have an experience I am not able to ...
5
votes
2answers
792 views

Multilinear optimization

Are there any efficient algorithms to solve, multi-linear objective and multi-linear constraint optimization problems? The multilinear functions are sums of bilinear, trilinear (and so on) terms ...
5
votes
3answers
124 views

Find min of $\frac{\left( \sum kx_k \right) \left( \sum x^2_k \right)}{\left( \sum x_k \right)^3}$

With $n \ge 2$ and $x_1,\ x_2,\ \dots,\ x_n > 0$. Find the minimum of: $$ M = \frac{(x_1 + 2 x_2 + ...+ nx_n)( x^2_1 + x^2_2 +...+x^2_n)} {\left( x_1 + x_2 +...+ x_n \right)^3}$$ For specific ...
5
votes
2answers
3k views

Solving an overdetermined system of nonlinear equations

I'm wondering what the "best" way to approach solving a system of the following form would be: $A_1X + Be^{CY} = A_2$ $A_3X + Be^{CY} = A_4$ $A_5X + Be^{CY} = A_6$ etc. EDIT: Coefficients $A_i, ...
5
votes
1answer
140 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 ...
5
votes
2answers
2k views

Minimizing with Lagrange multipliers and Newton-Raphson

I am writing a program minimizing a real-valued non-linear function of around 90 real variables subject to around 30 non-linear constraints. I found handy explanation in CERN's Data Analysis ...
5
votes
1answer
897 views

Solving a set of 3 nonlinear equations with constraints

Problem statement: I am given 3 sets of equations that govern the force $P$, and also the neutral axis, defined by two variables, the radius from the center $r$ and also the rotation degree in ...
5
votes
2answers
90 views

General solution to a system of non linear equations with a specific pattern

I am seeking a general solution to a system of non linear equations with a specific pattern: Order 1: $$ x_0 = a^2 + b^2 $$ $$ x_1 = 2ab $$ Order 2: $$ x_0 = a^2 + b^2 + c^2 $$ $$ x_1 = 2ab + 2bc ...
5
votes
0answers
304 views

(easier version)What is a working example for finding the maximum of a algebraic function $f(a,b,c,d,e)$ with 4 equality …

edit 2: If you are founding an answer would be interesting to you, please upvote this question, because i may use those point in order to start a new bounty. Edit 3: Can somebody answer? Edit 4:I ...
5
votes
1answer
439 views

How to optimize a rational function

Just a calculus problem: As a function of $K \geq 1$, what is the minimum value of $f/a + f/b + f/c + f/d + f/e$ subject to the following constraints? $$\begin{cases} 1 \leq a \leq c \\ 1 \leq b ...
4
votes
4answers
599 views

Approximate a function over the interval $[0, 1]$ by a polynomial of degree $n$ (or less).

To approximate a function $G$ over the interval $[0,1]$ by a polynomial $P$ of degree $n$ (or less), we minimize the function $f:R^{n+1} \to R$ given by $F(a) = \int_0^1 (G(x) - P_a(x))^2\,dx$, where ...
4
votes
2answers
525 views

Are the Karush-Kuhn-Tucker conditions applicable when one or more of the constraints are nonlinear?

I am just beginning to read about the use of "Concave Programming" methods and use of the Karush-Kuhn-Tucker conditions to identify the maximum value of a non-linear objective function subject to ...
4
votes
2answers
458 views

A naive approach for nonlinear optimization on several real variables and one natural variable. Give examples of (potential) failure

Motivation: Example. To solve a problem on evaluating the maximum of a product of $n$ real variables subject to an equality constraint on its sum $S$ ($=100$), I used the Lagrange multipliers method ...
4
votes
2answers
237 views

discontinuous optimization

I'm solving the following problem: $$ \max_\rho \;\; \rho \; \min\left[\left( \frac{bn}{an-bm} \right)[(a-m)-\rho], \frac{b}{a}[a-(p+\rho)]\right]$$ where all constants and variables are defined ...
4
votes
2answers
91 views

Maximize $\prod\limits_{i=1}^n m_i$

Someone visits a market where one hundred different types of fruit are sold. All types cost $1$ euro per pound. The utility the buyer receives from buying $m_1$ pounds of the first type of fruit he ...
4
votes
1answer
74 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, ...
4
votes
2answers
189 views

Finding an explicit expression for a minimizer

Suppose $f$ is a continuous function on the interval (0,1). We consider the energy functional $F(u) = \int^1_0\frac{1}{2}((u')^2+u^2)\,dx - \int^1_0fu\,dx$ which is well defined for continuously ...
4
votes
1answer
189 views

Kuhn-Tucker condition is not satisfied

Show that the solution to finding minimum of $f(x)=-x_{1}$ With conditions $-\sin(x_{1})+x_{2} \leq 0$ $x_{1}-x_{2} \leq 0$ is point $(0,0)$, but the Kuhn-Tucker condition is not satisfied in this ...
4
votes
1answer
834 views

Nonlinear Optimization/Programming: A good counter text

I am currently taking a nonlinear optimization course and the text is Bertsekas' "Nonlinear Programming 2e". I think the book does a decent job but I am a much more "hands-on" and visual learner so ...
4
votes
1answer
89 views

$P_{1c} = AP$ , $P_{2c} = BP$. How to find $P$? (being that $A$ and $B$ are $3\times 4$ matrices and $P$ is a $4\times 1$ vector)

This problem arose in my stereo vision project. $$ P_{1c} = A*P $$ $$ P_{2c} = B*P $$ where: $P_{1c}$ and $P_{2c}$ are $3\times1$ vectors, $A$ and $B$ are $3 \times 4$ matrices and $P$ is a ...
4
votes
1answer
177 views

Monotonic Function Optimization on Convex Constraint Region

So I have the following function, which I want to maximize: $$f(x_1,...,x_n) = \sum_{i=1}^n\alpha_i\sqrt{x_i}$$ (where all $\alpha_i$ are positive), subjected to the following equality and inequality ...
4
votes
1answer
59 views

Stuck on step in Lagrangian Problem

For $w,E$ column vectors, $i$ the vector of ones, and $\Sigma$ - an $n\times n$ positive definite symmetric matrix, I am trying to solve the following maximization problem: $$ \max_{\{ w\}} \left\{ ...
4
votes
1answer
179 views

Lipschitz continuity of parametric optimizer

Consider the parametric optimal solution $x^{*}: \mathbb{R}^n \rightarrow \mathbb{R}^n$ defined as $$ x^*( y ) := \arg\min_{x \in X } \ \ x^\top x + x^\top A y \\ \quad \qquad \text{subject to: } \ ...
4
votes
1answer
1k views

Linearization of a product of two decision variables

I am trying to solve a problem that involves constraints in which products of two decision variables appear. So far, I read that such products can be reformulated to a difference of two quadratic ...
4
votes
1answer
416 views

Scaling factor and weights in Unscented Transform (UKF)

I'm trying to implement the UKF for parameter estimation as described by Eric A. Wan and Rudolph van der Merwe in Chapter 7 of the Kalman Filtering and Neural Networks book: Free PDF I am confused by ...
4
votes
3answers
104 views

How do one solve a nonlinear combinatoric problem?

I am an undergraduate CS student and I am struggling with a problem. $Qx = b$ where $Q$ is a constant $m \times n$ matrix (with $m>n$), $x$ is a $n \times 1$ vector and $b$ is a $m\times 1$ ...
4
votes
2answers
697 views

Analog of Simplex Method for Quadratic Programming

It happened so I need to work with an algorithm for solving QP problems. The main issue here is that I can't find any references to this algorithms (at least no references in sources in english). ...
4
votes
1answer
80 views
+50

Gradient of the dual function for a nonlinear program

I'm attempting to find a proof for a property from Floudas' Nonlinear and Mixed-Integer Optimization book. Consider a nonlinear optimization problem of the form \begin{align} \min_{{\bf x}}&\quad ...
4
votes
1answer
44 views

An optimization problem involving a probability density function

I have three time-series $\mathbf{x}_{1}, \mathbf{x}_{2}, \mathbf{x}_{3}$. I would like to find a linear combination of the time series, that is, some scalars $a_{1},a_{2},a_{3}$ such that the sum ...
4
votes
0answers
136 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 ...
4
votes
0answers
46 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}} = ...
4
votes
1answer
70 views

QR-Decomposition of matrix valued function

I already posted the following question on MO, but id did not raise much interest there. Maybe the title is too elementary to gain research interest. Suppose I have a matrix valued function $$ ...
4
votes
0answers
36 views

Nonlinear optimisation of Expectation

I am preparing for my exams and I can't get my head around the following question. I know there exists a general method for solving these problems but I don't know where to start. I would greatly ...
4
votes
0answers
299 views

Optimizing non linear programs of two variables

The scenario is; We've got $n$ stationary 360$^{\circ}$ sensors in an confined area (each sensor is located at some arbitrary $\left(x,y\right) = \left(x_{n},y_{n}\right)$), once a unit $t$ enters ...
4
votes
0answers
188 views

Why Compactness is Necessary at Minimax Theorem

According to Von Neumann's minimax theorem, I have $$\max_{x\in X} \min_{y\in Y}f(x,y)=\min_{y\in Y} \max_{x\in X} f(x,y)$$ for some compact sets $X$ and $Y$ and a convex (in $y$), concave (in $x$) ...