# If a minimization task is a convex optimization problem, is its maximization also convex?

If a minimization task is a convex optimization problem, is the maximization of the same objective function also always a convex optimization problem?

My guess is yes since minimization of the negative of the objective function is maximization, but wondering if there are cases that outdo, and disprove, this sign 'trick'

• Note that the "negative" of a convex function will not usually be convex (because changing signs reverses the direction of the inequality). – hardmath Sep 11 '20 at 0:01
• No. In fact very often the minimization task is convex ("easy" to solve) while maximization is computationally extremely hard. – Michal Adamaszek Sep 11 '20 at 6:41

$$\min x^2,$$$$-1 \le x \le 1$$ is convex.
If you consider $$\max x^2 ,$$$$-1 \le x\le 1,$$
• can you provide an example that doesn't impose constraints on the decision variable $x$ – develarist Oct 14 '20 at 17:08
• but min $x^2$ and max $x^2$ would both be convex functions, which changes the validity of your answer – develarist Oct 14 '20 at 17:28
• $\max x^2 = - \min (-x^2)$, check that $-x^2$ is not convex. – Siong Thye Goh Oct 14 '20 at 17:29
• does $-$min$(-x^2)$ = min $x^2$? – develarist Oct 14 '20 at 17:30