# Questions tagged [disciplined-convex-programming]

Disciplined convex programming (DCP) is a system for constructing mathematical expressions with known curvature from a given library of base functions.

28 questions
Filter by
Sorted by
Tagged with
25 views

### how to implement the correlation coefficient in cvxpy and how to rewrite cp.diff(cp.cumsum(x)/(cp.cumsum(x)[-1])

suppose that I have 2 sets of data, x and y,where x can be ...
1 vote
96 views

389 views

### MIQP — CVXPY unable to treat summation of variables as a variable

I have a quadratic integer programming assignment problem. The goal is to assign riders seats on a bus such that distance between any two riders is maximized; however, the importance of each objective ...
224 views

### Quadratic optimisation with $\ell_1$ constraints with CVXPY

Crossposted on Mathematics SE I seek to minimize a convex quadratic objective subject to linear and $\ell_1$-based equality constraints. When I turn to CVXPY, an error is raised indicating that it ...
1 vote
42 views

### Handling Variable Division in CVXPY for Calculating Annualized Rate of Change

I am working with a dataset that contains multiple entries for different IDs across various years. Some IDs might have a gap of years between entries. My goal is to solve an optimization problem using ...
75 views

### How to rewrite a constraint with sum of convex and concave components to satisfy DCP rule?

suppose that decision variable is X with N dimensions, and one type of the constraint is ...
125 views

### How to linearize or fix this disciplined convex programming error?

How can I linearize this constraint $$d_{u,c}\sigma \le \|{\bf f}_{u,c}\|^2\le Td_{u,c}$$ $\sigma$ is a very small number based on scale of $f$ $T>0$, ${\bf f}_{u,c}$ is optimization variable, a ...
446 views

### How to formulate the inequality constraint $\sqrt{x^2+y^2} \leq z$ using gurobipy?

How to formulate the following constraint using gurobipy $$\sqrt{x^2 + y^2} \le z$$ where $x, y, z$ are continuous optimization variables? I saw how to formulate it using CVXPY: ...
313 views

### Express equality constraint involving exponentials cones

The exponential cone is define such that $(x, y, z) \in \text{ExpCone: if } y \exp(x / y) \leq z \land y > 0.$ The inequality $\exp(a) \leq b$ can be expressed as $[a, 1, b] \in \text{ExpCone}$. ...
280 views

90 views

### How to model these constraints correctly

$W$ is a vector of $N$ complex elements. $D$ is a binary variable The requirements are: when $D==1$, $L_{\min}\le ||W||_2^2\le L_{\max}$ and when $D==0$, $||W||_2^2=0$ I have formulated the following ...
214 views

### Make Optimization term fit into DCP rules

I want to make a term in an objective function I am working with fit into DCP for CVXPY. I am working on replicating this research paper for an active learning problem. Specifically equations 5 is ...
240 views

### DCP representation of a convex quotient of affine functions

I am trying to represent the following inequality: $$\frac{x}{1-x} \leq y \qquad\mathrm{with}\qquad 0<x<1$$ The function on the left is convex (its second derivative is always positive over ...
65 views

### Help with constrained or regularized optimization problem involving variable matrices and powers of matrices (or perhaps matrix logarithms)

I am attempting to solve the following optimization problem: $$\small\min_{A,B,C} \| Y_A - AX_A \|_F + \| Y_B - BX_B \|_F + \| Y_C - CX_C \|_F + \lambda_1 \|B - A^2\|_F + \lambda_2 \|C - A^4\|_F$$ ...
316 views

### Disciplined convex programming representation of $x\cdot\min x$

How can I reformat the problem below to follow DCP rules? DCP rules are Disciplined Convex Programming Rules that allow convex programs to be solved. DCP Is there a way to reformat the problem ...
How do I turn my convex constraints (described below) into constraints that are DCP so that I can solve them in CVXPy? Is there some cheat sheet'' of standard tricks? I'm trying to implement the ...
I have the following multiobjective optimization problem. The objectives are non-conflicting. The Optimization Problem: \underset{\large{a^{(l)}_{c,u},f^{(l)}_{c,u},z_{l,t},l\in\mathcal{L}}}{\max}\...