2
votes
Accepted
How can I relax the equality constraint in this problem?
Let $g(x)=f(x, \log(1 - \exp(x))).$ Try plotting that to see if it is unimodal and, if so, whether the min is attained in the interior or only approached (infimum) as $x\rightarrow -\infty$ or as $x\...
2
votes
Convex approximation of an expression
No approximation is needed if you wish to minimize the expression. For maximization, see the material after "Edit".
Due to cyclic permutation invariance of trace,
$$\text{trace}(X) = \text{...
1
vote
Bilinear programming
You can "merge" to a single maximization over all variables.
Then use Gurobi (which can solve bilinear problems such as this to global optimality, given enough time and memory) or a general ...
1
vote
Convex approximation of an expression with fraction for CVX
I assume the given problem is
$$
\max \frac{\|ax-b\|^2}{\|cx+b\|^2}, x \in \mathbb{C}^N
$$
I may try the following relaxation. The given problem is equivalent to
$$
\begin{align}
&\max &\|ax-...
Only top scored, non community-wiki answers of a minimum length are eligible
Related Tags
convex-optimization × 196optimization × 69
linear-programming × 27
convexity × 24
mixed-integer-programming × 20
quadratic-programming × 18
nonconvex-programming × 18
nonlinear-programming × 17
cvxpy × 16
constraint × 15
duality × 13
disciplined-convex-programming × 13
python × 11
modeling × 10
solver × 10
linearization × 8
constraint-programming × 7
semidefinite-programming × 7
integer-programming × 6
kkt-conditions × 6
lagrange-multipliers × 6
reference-request × 5
gurobi × 5
disciplined-quasiconvex-programming × 5
cplex × 4