2
votes
Accepted
Relaxing non-affine equality constraints in convex optimization
Your reasoning is correct.
If $g(x)$ is a jointly convex function of $x$, then $g(x) \le 0$ is a convex constraint. However, if, as stated, $g(x)$ is not affine, then except for some trivial cases, $...
Only top scored, non community-wiki answers of a minimum length are eligible
Related Tags
convex-optimization × 181optimization × 64
linear-programming × 25
convexity × 25
mixed-integer-programming × 20
quadratic-programming × 17
nonconvex-programming × 17
constraint × 15
nonlinear-programming × 15
duality × 12
disciplined-convex-programming × 12
cvxpy × 11
modeling × 10
solver × 9
python × 8
linearization × 7
integer-programming × 6
constraint-programming × 6
kkt-conditions × 6
lagrange-multipliers × 6
semidefinite-programming × 6
reference-request × 5
gurobi × 5
cplex × 4
pyomo × 4