2
votes
1answer
96 views
Optimization problem - maximizing number of satisfied linear inequalities subject to a quadratic constraint
I am wondering what is known about optimization problems of the following type.
Our control x is a unit vector in $\mathbb{R}^n$. We are given a finite number of linear inequalit …
3
votes
2answers
156 views
Uniqueness of fixed points for rational transformations
Background
Let $a,b,c,d$ be nonnegative constants and consider the map $T\colon [0,1]\times[0,1] \rightarrow [0,1]\times[0,1]$ defined by
$$
T(x,y) := \left( \frac{1}{1 + ax + by …
2
votes
1answer
73 views
Maximizing supermodular functions
I have a real supermodular objective function which I want to maximize with constraint. The constraint is on the size, like |A|=k .
I am wondering if anyone can give me more inf …
1
vote
1answer
281 views
for what arguments the function reaches maximum?
Hi,
What is the maximum of the following function?:
$f(x_i,w_i)=\frac { \sum w_i}{ \sum \frac {w_i}{x_i} } - \frac{ 1 - \prod \left ( 1 - w_{i}\right )}{ 1 - \prod \left ( 1 - …
0
votes
0answers
46 views
The role of subgradient in programming with nonsmooth functions
It is obvious that there is similarity between subgradient and gradient. The subgradient of smooth functions is reduced to gradient. I have two questions.
The first is does there …
0
votes
0answers
57 views
Optimal instance of quadratically constrained program
Consider the following optimization problem. Let $n, m \in \mathbb N$ and $0 < p_1 \leq \ldots \leq p_n ~ (p_i \in \mathbb R)$ be constant. The feasible region is described by a …
1
vote
1answer
110 views
What kind is this optimization problem
I come across a problem like
$\max {\frac{1+v}{1-u}}$
$s.t.~$ $ux^2+vy^2-xy\ge0$ $\forall x,y\in\mathbb{R}$
I do not know much of optimization.
What I have done is that $ux^2+vy …
1
vote
1answer
85 views
lipschitz constant of a multivariate function
I have a function $f:\mathbb{R}^{50} \rightarrow \mathbb{R}$ and I need to compute the Lipschitz constant of $f$ to solve an optimization problem using a specific algorithm. Does a …
2
votes
1answer
56 views
Computing a point of refraction
Oddball question: say I want to travel from $(a, b)$ where $b > 0$ to $(c, d)$ where $d < 0$ using the shortest path, where I can travel at velocity $v_1$ in the upper half-plan …
3
votes
0answers
123 views
Generalization of the equilateral triangle ?
I consider points in the two-dimensional plane.
An equilateral triangle is a set of three points in the plane which are equidistant.
Suppose now I have $n$ points $x_1,...,x_n$. …
0
votes
1answer
52 views
Avoiding epsilon in mixed integer linear and quadratically constrained programs
I would like to represent the following constraint as MILP constraint where $x \in [a, b]$ with fixed $a, b \in \mathbb{R}$ and $y \in \lbrace 0, 1 \rbrace$.
$(x = 0 \wedge y = 1) …
1
vote
0answers
84 views
Trying to get an idea of the maths I could use for this optimization problem
Firstly, apologies if some of the notation or terminology is odd, or if I am defining functions that have standard notation associated with them already - I am not familiar with th …
0
votes
1answer
307 views
Finding the lowest cost set of disjoint paths using all nodes in a directed graph?
I have a directed graph with edges connecting nodes representing costs.
I wish to find the set of paths which
-go from node 'start' to node 'end'
-are node-disjoint (except for t …
0
votes
1answer
110 views
necessary and sufficient conditions for a function to be DC
Hi, Does anyone know the necessary and sufficient conditions for a function to be a DC-function?
Definition: A function is a DC-function if and only if it can be written as a dif …
1
vote
2answers
232 views
non convex optimization
Hi there,
In my studies I come up with this nonconvex optimization problem
argmin |Ax|_2+lamda*|x|_1 subject to x'x=1
where cost function is nonsmooth but convex and the constrant …

