# Confusion related to a convex optimization problem

I was going through Stephen Boyd's lecture on convex optimization. However, I am a bit confused about a problem

Given Minimize $f(x) = x_1^2+x_2^2$

subject to $f_1(x) = \frac{x_1}{1+x_2^2} \leq 0$

How come $f_1(x)$ is not convex?

I was going through Stephen Boyd's book related to convex optimization http://www.stanford.edu/~boyd/cvxbook/bv_cvxbook.pdf

Here is the exact screenshot of the page

-

1
I cant understand you question, what do you want to know? Do you want to know if $f_1$ is convex? – Tomás Jan 10 at 16:01
– whuber Jan 10 at 16:19
The constraint only says $x_1 \le 0$. So looks like min is $0$ when $(x_1,x_2)=(0,0)$. – coffeemath Jan 10 at 17:23
Compare $f(1,0)$ with $\frac12\big(f_1(1,1)+f_1(1,-1)\big)$. Or fix $x_1=1$ and check the sign of $\frac{\mathrm d^2}{\mathrm dx_2^2}f(1,x_2)$. – Rahul Narain Jan 10 at 19:38
@Tomás. Yeah I want to know why $f_1(x)$ is not convex? – user34790 Jan 10 at 19:43

## 1 Answer

Look at $f_1$ along any "vertical" line $x_1=c$ where $c\neq0$. For positive $c$, you get a failure of convexity near the $x_1$-axis, and for negative $c$ you get a failure of convexity far from the $x_1$-axis.

-
{"extraction_info": {"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 19, "mathjax_display_tex": 0, "mathjax_asciimath": 0, "img_math": 0, "codecogs_latex": 0, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0}, "config": {"markdown_headings": true, "markdown_code": true, "boilerplate_config": {"ratio_threshold": 0.18, "absolute_threshold": 10, "end_threshold": 15, "enable": true}, "remove_buttons": true, "remove_image_figures": true, "remove_link_clusters": true, "table_config": {"min_rows": 2, "min_cols": 3, "format": "github"}, "remove_chinese": true, "remove_edit_buttons": true, "extract_latex": true}, "english_confidence": 0.9099162817001343, "perplexity_flag": "middle"}