Questions tagged [disciplined-quasiconvex-programming]
The disciplined-quasiconvex-programming tag has no usage guidance.
5
questions
3
votes
1
answer
87
views
On a clarification on usage of inequalities in convex programming
The inequality $x^3\leq y$ is not convex. But $0<x$ added to the above provides a convex region.
My question is whether in convex programming it is allowed to use both inequalities together and use ...
- 131
2
votes
1
answer
138
views
How to minimize a quasi-convex function in 2 dimensions?
I know that if $f$ is a quasi-convex function in one dimension (that is, $f: \mathbb{R} \to \mathbb{R}$), then we can use the 'golden section' line search to find the optimizer.
Now suppose I have a ...
- 131
5
votes
2
answers
262
views
Piecewise linear and global optimization
I am new to OR, and apologies if my mathematical notation is not clear. I have tried my best to keep it concise and given an explanation with numerical data.
I would like to understand:
Can this ...
- 81
2
votes
0
answers
132
views
How to linearize this multiplicative constraint?
I have a constraint in the form
$\sqrt{|\sum_{c\in C}{h_cw_c}|^2}\ge\sqrt{x}\zeta$
Here, $h_c$ is s row vector (know), $w_c$ is a column vector (variable).
$x$ and $\zeta$ are also optimization ...
- 2,179
7
votes
1
answer
205
views
Maximizing a Ratio/Percent
I'm using cvxpy to model a problem. Inside a very large and complex LP, I create two continuous, affine (unconstrained) expressions: $x$ and $y$. Due to how they ...
- 195