Questions tagged [convex-optimization]
Convex minimization, a subfield of optimization, studies the problem of minimizing convex functions over convex sets. The convexity property can make optimization in some sense "easier" than the general case - for example, any local minimum must be a global minimum.
5
questions
12
votes
2answers
456 views
Convex Maximization with Linear Constraints
I am doing active research in convex maximization w.r.t. linear constraints. There are many cases which can be efficiently approximately solved, e.g., convex quadratic maximization, log-sum-exp ...
4
votes
1answer
152 views
Cutting-planes application procedure for a specific problem
Sort of following up with this question. I reformulated another model to make it convex and possibly solve it with some cut generation method. I would like to double-check whether I am doing it ...
3
votes
1answer
132 views
Can we get the closed-form solution for this problem?
Can we get the closed-form solution for this problem?
\begin{align}
\min&\quad\sum_{i=1}^N\frac{K_i}{x_i\log_2(1+\frac{Q_i}{x_i})}\\
{\rm{s.t.}}&\quad\sum_{i=1}^N x_i\le X
\end{align}
wherein $...
1
vote
1answer
87 views
How to transform this problem with logarithmic objective function into an approximated convex optimization problem?
I have an objective function as follows
$\underset{x_{m,n}}{\max}\hspace{1mm}\hspace{1mm}\sum_{m=1}^{M}\log_2\left(\frac{\sum_{n=1}^{N}(1-x_{m,n})\omega_{m,n}+z}{\sum_{n=1}^{N}x_{m,n}\omega_{m,n}}\...
1
vote
1answer
238 views
How to mathematically formulate the optimization problem?
I have a system with $S$ service points.
There are also $U$ users in the system.
We have $$U>S>G$$
One group can have maximum $M$ service points, but there is no restrictions on the number of ...
