I am from the field of economics. For an agent's utility maximization it's common to use convex optimization following the lagrange maultiplier method. This is mostly used to get an analytical result; "The effect of variable $a$ on the value of the variable $X$ that satisfies optimality"
Regarding non-convex constraints, for example for maximizing utility $U$
$$U = α_c \log (c) + α_n \log (n) + α_q \log (q)$$
constrained by: $$c + nb_0 + sn ≤ wl_w$$
where
$$s = f(q)$$
Hence
$$c + nb_0 + f(q)n ≤ wl_w$$
according to the authors (Jones et al, 2008, p.29) the non-linear term $f(q)n$ makes the constraint non-convex. They proceed to apply the "Change of variable" technique to convexify the constraint.
My question: In several set-ups the change of variable technique is an algebraic hassle, which made me think; if we are not seeking a numericl solution anyway, wouldn't solving the initial problem suffice to explore the dynamics that lead to the solution? I am not a mathematician by any stretch of the imagination, so I am anxious that I am missing something obvious.
Citation: Jones, Larry E., Alice Schoonbroodt, and Michele Tertilt. Fertility theories: can they explain the negative fertility-income relationship?. No. w14266. National Bureau of Economic Research, 2008.
This particular utility function $U(c, n, q)$ is monotonically increasing in each of its arguments, so it would be maximized as $c \rightarrow \infty$, $n \rightarrow \infty$, and $q \rightarrow \infty$. In other words, this utility function is not particularly interesting without the constraint. And the unconstrained problem doesn't tell you much about the optimal $c, n, q$ for the constrained problem.
This is in general true of most utility maximization problems. The constraint imposes a tradeoff between different things that humans would like $\infty$ of, and understanding behavior in light of the tradeoffs is exactly what economists seek to understand.
To state this more mathematically, that the constraint matters to the solution of the problem is equivalent to stating that the solution will lie on the boundary of the constraint region, or equivalently, that at the solution, the inequality will be tight (ie that the left-hand side and right-hand side will be equal).
This in turn means that how one "convexifies" the constraint really matters to the solution. If one performs a simple change of variable, then the solution will not change. If, on the other hand, one actually changes the constraint via "convex relaxation" (ie replacing the constraint with a similar convex constraint), it is possible that the solution will be different.