Convex analysis is the study of properties of convex sets and convex functions. For questions about optimization of convex functions over convex sets, please use the (convex-optimization) tag.

learn more… | top users | synonyms (3)

0
votes
1answer
26 views

Confusion on convex functions

I got a problem while solving a problem regarding convex functions on an interval $(a,b)$. What I had to show is if $f$ is convex then $f'$ exists except possibly at countably many points and is ...
0
votes
0answers
22 views

uniform convergences of convex functions

Let $f_n(\cdot)$ be a sequence of continuous and convex function on $\mathbb{R}^d$, and be supported on a full dimensional compact convex set $D$. If $f_n(\cdot)$ converges point-wise to $f$ in the ...
0
votes
1answer
60 views

Prove that the Cartesian Product of two Convex Sets is a Convex Subset

Here's the problem: Suppose that $S\subset \mathbb R^m$ is a convex set and $T\subset \mathbb R^n$ is a convex set. Show that the set $$S \times T = \{ (x_1 ,...,x_{m+n}\in \mathbb R^{m+n}):(x_1 ...
0
votes
2answers
45 views

Proving Convexity of an Open Disk

I need to prove that the following set is convex: $$ \{(x,y):x^2 +y^2 \lt 2\} $$ Obviously, this an open disk of radius $\sqrt2$. My intuition is to use triangle inequality for this proof because a ...
1
vote
1answer
51 views

How to derive the solution in quadratic optimization

I'm reading the book "Convex Analysis and Optimization" written by Prof. Bertsekas. In Example 2.2.1, there are the following description: I don't know how to ...
1
vote
1answer
44 views

Example of maximal monotone operators in non-reflexive Banach spaces with applications in PDE

My question is about examples of maximal monotone operators that are defined in non-reflexive Banach spaces and have applications in PDEs, variational inequalities, etc (any application actually)? If ...
0
votes
0answers
22 views

Proving disjoint sets and finding separating hyperplane

Consider \begin{equation} \mathbf{h}=\begin{bmatrix} h_0 & h_1 & \cdots & h_p \end{bmatrix} \end{equation} where $h_i \in \mathbb{R}\forall i=1:p$ and is known. \begin{equation} ...
0
votes
1answer
22 views

Projection on Epigraph of a convex function

Given a convex function $h:\mathbb{R}^n \mapsto \mathbb{R}$, and a point $(x,\alpha) \in \mathbb{R}^n \times \mathbb{R}$, how can I find a closed formula to compute the projection of $(x,\alpha)$ in ...
0
votes
3answers
89 views

Is the norm of a convex function convex?

I know that the norm of $x\in R^n$, $(\sum\limits_{i=1}^n|x_i|^2)^{0.5}$ is a convex function. Also, not any composition of two convex functions is convex. So my question is: Lets say we have a real ...
0
votes
1answer
25 views

Why is a local min also a global min for convex functions?

As the title states, for an unconstrained minimizaton problem, of a convex function, why is it that the local minimum is also the global solution?
2
votes
0answers
57 views

the continuity of argmin on convex funtion

Define $$x'=\text{argmin}_{x_1}f(x_1,\lambda),$$ where $f$ is a strictly convex function on $x_1$ and $\lambda$. I would like to ask if there is any theorem about the continuity of $x'$ w.r.t ...
1
vote
2answers
73 views

Lotka-Volterra First Integral and Fixed Point

I have the following problem that I am dealing with, quite a long time, I must say. Let us assume that we have a predator-prey, Lotka-Volterra system given to us by: \begin{align} & ...
1
vote
1answer
44 views

intuitive meaning of sphericity

i interested in the following definition but i don't understand it because i don't understand what mean by "flat space generated by C" . the same definition is given by i have also the same ...
0
votes
0answers
39 views

How to prove that convex function has an increasing slope?

A function $f(x)$ in some domain $a\leq x \leq b$ is convex if and only if for any $x_1 < x_2 < x_3$ from domain $[a,b]$, $$\frac{(f(x_2)-f(x_1))}{(x_2-x_1)} \leq ...
0
votes
0answers
69 views

Singularities in convex functions of more than one variable

I've heard that a convex function of a single variable is continuous in the interior of its domain, and is differentiable everywhere with the possible exception of a countable number of points. (I ...
0
votes
0answers
16 views

Question composition rules in standard deviation

Standard deviation is defined as following: $f(x) = (\frac{1}{n} \sum_{i=1}^nx_i^2-(\frac{1}{n} \sum_{i=1}^nx_i)^2)^{1/2}$ Obviously, $(.)^{1/2}$ is not convex, so can I say $f(x)$ is not ...
0
votes
0answers
28 views

convex function - global minimum

Suppose that $f(x):R^p \rightarrow R$ is a convex function with global minimum, say 0. Let $C=(x: f(x)=0)$, i.e. the set of the global minimum. Suppose that there exist at least one point $y$ such ...
2
votes
1answer
32 views

Does $\log(f(X))$ concave implies $\log(f(X^{-1}))$ convex?

One of my professor claims that $\log f(X)$ concave implies that $\log(f(X^{-1}))$ convex where $X$ is symmetric positive definite matrix. $\log(f(X))$ is a function defined on symmetric positive ...
1
vote
0answers
23 views

Subspace of tangent feasible directions

If $h: \mathbb{R}^3 \to \mathbb{R}^3$ defined by $h(x_1,x_2,x_3) = (x_1^3 - x_2 + x_3^2, x_2,x_1+x_2+x_3)$ I define $V(x)$ as a subspace formed by all directions tangent to some constrained set at ...
1
vote
0answers
38 views

Subdifferential of a convex function

How would I find a convex function $f: \mathbb{R} \to \mathbb{R}$ such that $\partial f(0) = [0,1]$ A subdifferential is just the collection of vectors $w \in \mathbb{R}^n$ such that $f(y) \geq ...
1
vote
0answers
21 views

Why is this set a subset of its polyhedral approximation - contradicting the gradient inequality?

Say we have a set $C:= \{y\in \mathbb{R}^n : g_i(y) \leq 0, \space i=1,...,m\}$ where $g_i : \mathbb{R}^n \to \mathbb{R}$ are convex and differentiable functions, then we have $\tilde C : = \{y: ...
1
vote
0answers
22 views

Convexity Proof with constraints on the gradient

Consider a minimization problem $(P)$ : minimize $f(x)$ subject to $\delta_C(x) \leq 0$ Now assume that $\emptyset \neq C \subset \mathbb{R}^n$ is convex and let $f: \mathbb{R}^n \to \mathbb{R}$ be ...
1
vote
1answer
19 views

Show the following statements are equivalent - convexity

Let $C \subset \mathbb{R}^n$ be a set. Show the following are equivalent: (a) The set $C$ is convex. (b) The function $\delta_C : \mathbb{R}^n \to \mathbb{R} \cup \infty$ defined as: ...
0
votes
0answers
17 views

About the alternating optimization

The problem is defined as follows: $$ min_{A,B,C} f(A,B,C) $$ and the problem couldn't solve by gradient descent or close-form solution. Thus, the usual way is to use the alternating optimization: ...
2
votes
2answers
73 views

Minimum volume covering ellipse

Given a convex polygon in the plane, consider the smallest-area ellipse which contains this polygon. This is the "minimal volume covering ellipsoid" or "minimal volume enclosing ellipsoid" or in short ...
1
vote
1answer
36 views

Convexity proof - can I get some pointers?

Prove that $C \subset \mathbb{R}^n$ is convex iff $\forall m \in \mathbb{N}$ and every set of $m$ points $\{x_1,...,x_m\} \subset C$ we have that $\sum_{i=1}^m \lambda_i x_i \in C$ Where ...
0
votes
1answer
29 views

Steepest Descent Sequence

How can I compute the first three iterates for the steepest descent sequence $f(x_1,x_2) = \frac{(x_1^2+3x_2^2)}{2}$ beginning at $x_0 = (\frac{\sqrt{3}}{2}, \frac{1}{2 \sqrt{3}})^T$ $\nabla ...
2
votes
1answer
32 views

Constructing a newton sequence

How may I construct the newton sequence for the following: $(1) f(x_1,x_2) = x_1^4 + 2x_1^2x_2^2 + x_2^4$ with $x_0 = (1,1)$ and $x_0 = (1,0)$ $(2) f(t) = t^4 - 32t^2$ and $t_0 = 1$ To find ...
1
vote
1answer
31 views

Different ways to prove convexity of quadratic form associated to rank 1 matrix

Let $v \in \Bbb R^n$, and $f:\Bbb R^n \to \Bbb R^n$ with $f(x)=\langle x,(vv^T)x\rangle$. Show that $f$ is convex. I'm looking for different approaches to solve this (rather simple) problem. ...
0
votes
0answers
41 views

A property similar to the convexity, but actually different?

If we know there exists a point $x_0$, such that $f(x_0)$ lies below the tangent line at $0$ of $f(x)$, which means below the line $y=f(0)+f'(0)x$. My question is how to prove this violate $f(0)\le ...
1
vote
0answers
55 views

Is the function $f(A)=-\log(tr(A^{-1}))-\log(\det(A))$ convex?

I am trying to show the following function is convex or not $$f(A)=-\log(\text{trace}(A^{-1}))-\log(\det(A)),$$ where $ A$ is positive definite. I know $\text{trace}(A^{-1}), -\log(\cdot)$ and ...
0
votes
0answers
19 views

Property of probability density function (pdf)

If $X$ is a random variable with a log-concave pdf. And suppose $Z = h(X)$ If $h(X)$ is convex, can we say $Z$ has a log-concave pdf? If $h(X)$ is affine, can we say $Z$ has a log-concave pdf? ...
1
vote
0answers
33 views

Legendre Transform of this function

Is the Legendre-Fenchel transform of $$f(x)=1-\sqrt{1-|x|^2}, x\in B(0,1)\subset\mathbb{R}^n$$ just $$f^*(x^*)=-1+\sqrt{1+|x^*|^2}?$$ I calculated this using the table here ...
1
vote
1answer
72 views

Chebyshev sets in finite dimension are closed and convex

Prove a finite-dimensional converse to the “best approximation theorem”: Let $K$ be a subset of a finite-dimensional Hilbert space $H$ which satisfies the following property: for each $x \in H$ there ...
1
vote
0answers
50 views

Proximal Mapping of Composition with Linear Operator

I've posted this question on math overflow but got no answer, so I think it might not be a research level question so I decided to post it here too. Let $A$ be an orthogonal matrix. It is well known ...
0
votes
0answers
23 views

Dot product - geometrical interpretation in convex analysis

I am studying a theorem on the characterization of solutions in nondifferentiable convex problems. Say that $\emptyset \neq C \subset \mathbb{R}^n$ is convex and $f: \mathbb{R}^n \to ...
0
votes
1answer
36 views

Normal cone to the tangent cone of $\mathbb{R}_+$

These are the definitions I'm using (cf Rockaffeller): normal cone to a convex set $C$: $$\mathcal{N}_C(x)=\{d\ | <d,y-x>\leq 0,\ \forall y\in C\}$$ tangent cone to a convex set $C$: ...
6
votes
1answer
76 views

References for hemicontinuity?

Let $X$ be a real vector space, $K\subset X$ be a nonempty and convex set. The mapping $f:X\rightarrow\mathbb{R}$ is said to be hemicontinuous if for every $u,v\in K$, the mapping ...
0
votes
1answer
39 views

How to show that SVM is convex problem

It's well-known fact that SVM is convex problem $min \frac{1}{2} \left \| w \right \|^2$ s.t. $(wx_i+b)y_i \geq 1$ I don't understand how given the LP formulation of SVM I can coclude that it's ...
0
votes
0answers
38 views

$Ax = b$ & $Ax + b$

Ask a dumb question but confuse me long time. The following is what I know: 1st case $Ax = b$ is an affine set in $x$,i.e. $\{x | Ax = b\}$, and it is linear in $x$. 2nd case $ f(x) = Ax + b$ ...
0
votes
0answers
23 views

convex function divided by convave function is quasiconvex

$p(x) \geq 0$ is convex, and $q(x) > 0$ is concave. How to prove $f(x) = \frac{p(x)}{q(x)}$ is quasiconvex? My proof is using t-sublevel set: $\{x | \frac{p(x)}{q(x)} \leq t\}$ is ...
0
votes
1answer
47 views

Can we claim that $f(x)$ is an increasing function and its stationary point is $x = \infty$ (in this specific case)?

If $f(x)$ is concave and its first derivative $f'(x) \rightarrow 0$ when $x\rightarrow \infty$, can we claim that $f(x)$ is an increasing function and its (only) stationary point is $x = \infty$ ? ( ...
0
votes
1answer
39 views

Does analytical solution exist for this convex euclidean affine projection problem with non-negativity constraints?

I've come across this convex optimization problem in my research where I need to project a matrix $X_0$ onto a non-negative affine space constraint and box constraints. Concretely, $X \in ...
1
vote
1answer
28 views

Why is $J(u) := \int_\Omega |\nabla u|^2$ convex?

Define $J(u) := \int_\Omega |\nabla u|^2$ over $\{ u \in H^1(\Omega) : tr(u) = g\}$. Why is $J$ convex? I keep getting $J(tu + (1-t)v) \leq 2t^2J(u) + 2(1-t)^2J(v)$ by using the triangle inequality ...
0
votes
0answers
23 views

convex region with 7 vertices

Let, $X$ be a convex region in the plane bounded by straight lines. Let, $X$ have $7$ vertices. Suppose $f(x,y)=ax+by+c$ has maximum value $M$ & minimum value $N$ on $X$ & $N<M$. Let, ...
1
vote
2answers
30 views

Is this set of matrices convex?

The set of positive definite matrices is convex. But what about this set? $$\Omega = \left\{ (\mathbf{A}, \mathbf{b}) \in \mathbb{R}^{n \times n} \times \mathbb{R}^n : (\mathbf{A} - ...
0
votes
0answers
24 views

Need to prove a property using super modularity and convexity

I have a function $f(x,y)$ that is convex on both x and y separately (but maybe not a joint convex function). It is also super modular. Assume that we have ordered sets of $x$ and $y$ as $(x1\gt x2,\ ...
2
votes
1answer
24 views

Proof: number of intersection points of borders of a convex polygon and its translate never greater than 2

How can I prove the observation that the borders of a convex polygon $P$ with no parallel sides in $\mathbb{R}^2$ and a translate of $P$ by any vector $t\neq 0 \in \mathbb{R}^2$ that is not parallel ...
1
vote
0answers
31 views

Fenchel Conjugate of a norm squared

I was wondering if the fenchel conjugate of the $\frac{1}{2}||u||^2$, is the $\frac{1}{2}||u||_*^2$, where $||.||_*$ is the dual norm of $||.||$. This seems to be true for the $\ell_2$ norm. However, ...
1
vote
0answers
24 views

Mean width of an ellipsoid

Let $E$ be an ellipsoid in $\mathbb{R}^d$ defined by the equation $\sum \frac{x_i^2}{a_i^2}=1$. Is there a formula to express the mean width (or an approximation of the mean width) of $E$ in term of ...