Which of the following is NOT an operation that preserves the convexity of sets?
Let \( f : \mathbb{R}^d \to \mathbb{R} \) be twice continuously differentiable. Which of the following conditions is sufficient for \( f \) to be convex?
Which of the following statements is true about convex functions?
Consider a convex function \( f : D \to \mathbb{R} \), where \( D \subseteq \mathbb{R}^d \) is convex. If \( x_0 \) is a local minimizer of \( f \) over \( D \), then:
Let \( f : \mathbb{R}^d \to \mathbb{R} \) be a continuously differentiable, convex function. Which of the following is a necessary and sufficient condition for \( x_0 \) to be a global minimizer of \( f \)?
A function \( f : \mathbb{R}^d \to \mathbb{R} \) is \( m \)-strongly convex if:
Let \( f : \mathbb{R}^d \to \mathbb{R} \) be twice continuously differentiable. Which of the following is equivalent to \( f \) being \( m \)-strongly convex?
Let \( D \subseteq \mathbb{R}^d \) be a nonempty, closed, convex set. For \( x \in \mathbb{R}^d \), the projection of \( x \) onto \( D \), denoted by \( \mathrm{proj}_D(x) \), satisfies:
Which of the following statements is true about the least-squares objective function \( f(x) = \|Ax - b\|_2^2 \), where \( A \in \mathbb{R}^{n \times d} \) has full column rank and \( b \in \mathbb{R}^n \)?