The tag has no wiki summary.

learn more… | top users | synonyms

4
votes
0answers
20 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 $$ ...
1
vote
0answers
8 views

What is some prerequisite to study nonlinear programming?

What is some prerequisite to study nonlinear programming? I already know calculus and linear programming is two perquisite, what else?
0
votes
1answer
28 views

Gradient of Objective Function

I want to know how to calculate the gradient $\triangledown f\left ( \mathbf{x} \right )$ of this functions: $f\left ( \mathbf{x} \right )=\left | \mathbf{a}^{H}\mathbf{x} \right |^{2}$, ...
1
vote
2answers
25 views

Optimization of Product of Different Objective functions (Ex.: Maximize The Product of projections of a complex vector)

Suppose We have this optimization problem which is convex $\mathbf{x}={\arg}\: \underset{\mathbf{x}}\max f_{i}\left (\mathbf{x} \right )$ But the product of different objective function is ...
0
votes
0answers
21 views

minimizing sum of squares

Say i have the following optimization problem. min $\sum\limits_{i=1}^m \parallel r - (y_i - Rx_i) \parallel_2^2$. where we are optimizing over $r \in R^n$ and also $R \in R^{n, n}$ is given. Also, ...
1
vote
0answers
19 views

Inequality optimization, KKT condition.

So we have the problem: maximize $x^2+y^2$ subject to $x^2-y \leq3$ and $y\leq 1$. And I sorted out the KKT conditions for the problem (is here where the problem is?): $2x=\lambda _12x$, ...
5
votes
3answers
93 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 ...
1
vote
3answers
41 views

Minimizing sum of squared distances from point to spheres

Given some spheres with known radius and known origin in three dimensional space, I want to find the point P that lies "closest" to all these spheres. The meassure of closeness, I guess, will be the ...
1
vote
0answers
17 views

Chain rule to compute the Jacobian of a geometric transformation

This question is related to image alignment. I'm transforming some points in homogeneous coordinates then "de-homogenouzing" them. The transformation is a rigid-body transform in 3D parameterized by ...
0
votes
1answer
7 views

Sets of feasible directions

I'm not exactly sure how the different points matter. I believe $p=[1,1,-1]^T, [2,-1,0]^T, [3,0,-1]^T, [0,3,-2]^T$ are all feasible directions.
0
votes
1answer
39 views

Maximizing the product of projections of a vector on another vectors

I want to get the $N\times1$ complex vector $\mathbf{x}$ which maximizes this real valued function $f=\mathbf{x}^{H}\left (\mathbf{a}_{1} \mathbf{a}_{1}^{H}\mathbf{x}\mathbf{x}^{H}\mathbf{a}_{2} ...
1
vote
1answer
18 views

Impact of constraints on convex optimization

Let me start by saying I know almost nothing about optimization so please bear with me. Basically, I am wondering whether it is possible to solve a problem with two constraints by solving the problem ...
0
votes
0answers
18 views

Hessian of a non-linear Matrix function

Apologies if this is a silly question, but I am really confused. I am trying to find the Hessian of a non-linear function $f$. I understand that the Hessian of $f$ with respect to $A$ is the Jacobian ...
1
vote
0answers
12 views

General 2D taylor surfaces from axial behaviour and discrete points

I have a problem as follows: I have a nonlinear function, f(x,y), for which I (numerically) know the axial behaviours, f(x,y0) and f(x0,y), where x0 and y0 are constants. I can calculate discrete ...
0
votes
1answer
15 views

Finding the maximum/minimum of a homogeneous function on $R^n$

Suppose that $f:R^n\to R$ is homogeneous. Also, suppose that the $argmin_xf(x)$ is non-empty. Is it true that if there exist $x^*\in R^n$ such that $f(x^*)=0$, then $x^*=argmin_xf(x)$?
1
vote
2answers
27 views

Nonlinear optimization in exponents

$$ max \pi = 4x_1^\frac{1}4x_2^\frac{1}3 - x_1 - x_2 $$ It is not difficult to determine that this function is concave and yields a global maximum at some point for the quantities $ x_1, x_2 >= 0 ...
1
vote
1answer
37 views

KKT point of a constrained optimization problem

Min$_{x}~x$ Subject to $x \geq 0$ For this problem, is $(x^{*}, \lambda^{*})=$$(0,0)$ a KKT point ? My try : I formulated corresponding Lagrangian and tried to find out the KKT point(s). ...
0
votes
1answer
32 views

Convex functions -> quasi-convex functions -> … can we weaken the assumptions?

First of all let me say that I'm new to optimization. I realized that quasi-convex functions share with convex functions some nice properties, so I wonder if we can push the weakening a little ...
0
votes
0answers
13 views

Unconstrained Nonlinear Nonconvex Optimization: LBFGS vs. Interior Point Methods?

I'm finding the literature on interior point methods somewhat inaccessible but I've found papers benchmarking different interior point methods for unconstrained nonlinear Nonconvex optimization. I ...
0
votes
0answers
31 views

least-square optimization with linearly depend solution $x$

What is the exact solution $x_{n \times 1}$ of the following constrained optimization problem \begin{align*} &\min \|AX-b\|^2 \\ s.t.&Cx=0 \end{align*} where $A$ is full column rank $m \times ...
1
vote
0answers
33 views

An indirect optimizing problem

we have $z_1=x_1y_1$ , $z_2=x_2y_2$ and $z=xy$. we know $x<x_1+x_2$ and $y<y_1+y_2$. Can we conclude minimizing $z_1$ and $z_2$ will lead us to minimum (or lesser values) of $z$? ...
1
vote
2answers
29 views

Minimizing a convex cost function

I'm reviewing basic techniques in optimization and I'm stuck on the following. We aim to minimize the cost function $$f(x_1,x_2) = \frac{1}{2n} \sum_{k=1}^n \left(\cos\left(\frac{\pi k}{n}\right) x_1 ...
0
votes
1answer
31 views

Can SVD help to solve (inequality) constrained least squares problem?

Consider the following minimization problem: $$ ||Q u - h^{o} ||^{2} \to min \;\;\; s.t. \; u \geq 0 $$ where $Q$ is $m \times n$ matrix and $u$ is $n$-dimensional vector and $h^{0}$ is ...
0
votes
1answer
19 views

Non-linear estimate parameter

I have one non-linear function that define $$E_x(a,b)=\int K_\sigma(y-x) \cdot(b-b. e^{-a\cdot f(y)} \,) dy$$ where $y$ is neighboor points of $x$; $f(y)$ is a function of $y$; and $a$ is constant. ...
0
votes
0answers
5 views

Linear Quadratic Bilevel Programming Problem

How to solve this type of linear-quadratic bilevel programming problem ? Please help.
0
votes
1answer
27 views

Noncontinuous subadditive function

Is there any non-continuous additive function $f(x+y)= f(x)+f(y)$ from $\mathbb R$ to $\mathbb R$?
0
votes
0answers
42 views

Expressing rank condition of a matrix in terms of its elements

Let $x \in \mathbb{R}^{n}$, define $X = xx^{T}$. I have an optimization problem with some linear constraints and few quadratic constraints, and I have to solve for $x$. Using $X$ as the unknown ...
0
votes
0answers
40 views

A simple optimization problem\

The original problem is As g(y) is independent of variable x, so I break this joint optimization problem into two optimization problems, i.e, and . The variables x and y should be larger than ...
1
vote
0answers
32 views

using lsqcurvefit to fit piece-wise linear

I would like to use this function to fit piece-wise linearly to a set of data. Namely, I want to fit them with several linear segments. Including other requirements, I would not want the segments ...
2
votes
0answers
54 views

Maximize a function subject to the constraint $x^2+y^2=R^2$

Please help me how to deal with maximization of function $$f(x,y)=1-e^{-\pi x}+e^{\pi x}\left[1-\cos(\pi y)+\sin(\pi y)\right]$$ subject to the constraint $x^2+y^2=R^2$. Using Lagrange ...
1
vote
0answers
44 views

transforming nonlinear matrix inequality to LMI

I faced some nonlinearity in my problems. I need to check a matrix inequality condition in order to check the feasibility of designed controller through a continuous design problem. My problem is that ...
1
vote
1answer
53 views

Why is this a quadratic programming problem?

I am sorry if this is a stupid question, I'm very new. How would I minimize the following objective? $\sum_{k=1}^p\| I_{k} - M_{k}A \|^2$ Each I and M are known. I am told I can use a quadratic ...
0
votes
0answers
22 views

Non-linear, non-convex optimization problem

I would like to solve the following optimization problem: $$ \max\{\min_{k=1,2,...,m}\{R_d^k\}+\sum_{k=1}^m R_e^k\} \\\text{s.t.} \\ \mathrm{trace}(W_d^kW_d^{kT})=1 \\ \mathrm{trace}(W_e^kW_e^{kT})=1 ...
3
votes
1answer
41 views

How to find the minimal value of this function under such constraint

$f(x,y)=x-\sqrt{y-x^2}$ with $a<x<b$ and $x^2<y<c*x-d$. What I did is, first take partial derivative at $x$ and $y$ respectively, however, there is no critical point because fy is always ...
3
votes
2answers
75 views

Singular Values of Matrix as Optimization Problem

Assume that $A$ is a positive semidefinite symmetric matrix. It is known that $$\max_{||y||\leq1} \quad y^TAy$$ Has an analytical solution which is the maximum eigenvalue of $A$. This isn't hard ...
0
votes
0answers
64 views

Calculation of the set for the polar tangent cone?

I have the following theorem in my book. Assume that $\tilde{x}$ is a local minimum from a minimization problem and that f(.) is differentible at $\tilde{x}$ Let $T_X(\tilde{x})$ be the tangent cone ...
0
votes
0answers
31 views

Complex Non-liner First order ODE problem

Good day people I am modelling a "water bottle rocket" using basic Continuum Mechanics. I have found a equation describing the acceleration of the rocket. I need to integrate this function to find ...
2
votes
1answer
74 views

Extremum of functional of a complex function

consider functional $E$ defined by $$E[z]=\int F(x,z(x))dx$$ where $F$ is a complex-valued nonlinear function. How can we find the function $z(x)$ so that $$G=|E|^2=EE^*=\iint ...
1
vote
1answer
31 views

The most optimal way to solve this set of non-linear equations in high dimensions

So I have a series of non-linear equations which I wish to solve as fast as possible, to illustrate for the case of $n = 4$, I have the following equations: \begin{gather*} ...
0
votes
1answer
29 views

Is it possible to convert into linear programming problem

I have a problem of the form $$\sup_{x\in\Bbb{C}^n}\left\{\frac{\|Ax\|_\infty}{\|Bx\|_\infty}\right\}$$ where $A$, $B$ are matrices with different number of rows and $x$ is an $n$ dimensional vector. ...
0
votes
0answers
30 views

Combinations of Convex Functions

I'm looking at the following non-linear optimization theory problem: Let $\gamma$ be a monotone nondecreasing function of a single variable (that is, $\gamma(r) \le \gamma(r')$ for $r' > r$), ...
0
votes
0answers
36 views

Proofs involving closedness of compositions of mappings.

I've feel like I've gotten myself in over my head in a non-linear optimization course I seem to lack the mathematical maturity for(I'm an undergrad, I've taken the calc series, Intro to differential ...
0
votes
0answers
11 views

Implementing a projection with KL-divergence

I want to implement the following and I am looking for an easy/fast way to implement it(the programming language does not matter). Assume that $p(\mathbf{x})$ is a proper probability distribution and ...
2
votes
1answer
31 views

Conceptual Understanding of Non-Linear Optimization Problem

I'm in non-linear optimization, and I'm having trouble wrapping my head around what this problem is asking me for. If anyone could help with a conceptual explanation (not an answer!), it'd be greatly ...
0
votes
0answers
20 views

complexity of an optimization problem

Consider $n$ variables $x_1, \cdots, x_n$ with the constraint $\sum_{i=1}^n x_i=1$ and $x_i\geq 0$. I want to minimize $\vec{a}^T (I-\alpha A(\vec{x}))^{-1} \vec{b}$, where $\vec{a}$ and ...
1
vote
0answers
30 views

How to minimise an objective function which is not a direct function of the decision variable?

I have a problem with partitioning a water network by closing some pipes. I use some graph theory techniques to find some candidate pipes to close; but to select which pipes among them to close (my ...
1
vote
1answer
31 views

Prove that a multivariable function doesn't have global extremes

So my question is actually this. Say I have a function $F:\mathbb R^2\to\mathbb R$. If I find all the potential local extremes by finding the roots of the partial derivatives and I find that only one ...
0
votes
3answers
51 views

shortest distance between two points [duplicate]

I could not solve the following problem, Please help me, Let $P_1=(x_1,y_1)$ and $P_2=(x_2,y_2)$ be two given points. find the third points $P_3=(x_3,y_3)$ such that $d_1=d_2$ is minimized, where ...
0
votes
0answers
39 views

is there any infinity norm bound to simplify this

I have a problem of the form $$\sup_{x\in\Bbb{C}^n}\left\{\frac{\|Ax\|_\infty}{\|Bx\|_\infty}\right\}$$ where $A$, $B$ are matrices with different number of rows and $x$ is an $n$ dimensional vector. ...
-1
votes
2answers
36 views

Constraints in optimization; redundant hardness?

This is not an accurate mathematical problem, and rather a philosophical and ambitious question. As far as I know, unconstrained problems are easier than constrained problems; right? This is mostly ...