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 (1)

1
vote
1answer
115 views

Union of convex sets is convex: Strategy?

I am working in convex geometry for the summer with little experience beforehand. It's a lot of fun but it does mean I don't know some of the basic things. I know that it is not generally true that ...
1
vote
1answer
19 views

Infinite dimensional convex cones

Let $C$ be a convex cone in a topological real vector space $V$. Assume that we have a linear functional $\varphi: V \to \mathbb{R}$ such that $\varphi(x) \geq 0$ for all $x \in C$. Further assume ...
0
votes
0answers
21 views

Detecting faces of polytopes

I am working in convex geometry for the summer with little experience beforehand. It's a lot of fun but it does mean I don't know some of the basic things. I'm interested in the orbits of finite ...
0
votes
1answer
43 views

uniqueness of Hahn-Banach extension for convex dual spaces

Let $X'$ be strict convex, i.e. for all $x_1',x_2'\in X'$ with $\|x_1'\|_{X'}=\|x_2'\|_{X'}=1$ the implication $$\left\|\frac{x_1'+x_2'}{2}\right\|=1\Rightarrow x_1'=x_2'$$ holds. In this case the ...
2
votes
0answers
31 views

Lower semicontinuity of a Bochner integral of a convex function

I'm looking for the following result: Let $\Omega \subset \mathbb{R}^n$ be a bounded domain and let $f$. The map $$u \mapsto \int_0^T \int_{\Omega} f(u(t))$$ is lower semicontinuous for $u \in ...
7
votes
0answers
227 views

Theorem about convex sets

I want to prove a theorem (the link is after the whole text here) and in order to do that I need to prove three preliminary statements. I tried to prove them all but I'm already stuck in the first, ...
3
votes
2answers
37 views

about an interesting affirmation involving convex sets

Consider the following definition Definition: Let $\Omega \subset R^n$ a bounded convex set. A point $x \in \partial \Omega$ is called an extremal point if $x$ cannot be written as linear ...
0
votes
0answers
16 views

Volume of a polytope with relaxed constraints

Consider a polytope in $n$ dimensions defined by a set of linear constraints: $$P = \{x \in \mathbb{R}^n : Ax \leq b\}$$ where A is some $m \times n$ constraint matrix, and $b = (b_1,\ldots,b_m)$ is ...
0
votes
1answer
15 views

Nominalization for being “not convex” and “not coercive”

Having a function f which is neither convex nor coercive. What is the correct nominalization for these properties? I suppose something like ...
1
vote
0answers
87 views

Nerve Theorem: Is the finite union of closed convex sets triangulable?

My Question: Let $A_1, \ldots, A_k \subseteq \mathbb{R}^n$ be closed convex sets. Is the union $\bigcup_{i=1}^k A_i$ triangulable$^1$? If so, why? Background: I'm trying to better understand the ...
0
votes
2answers
22 views

Difference quotient inequality with convex functions

A convex function on an interval $ I $ is said to be convex if for every $ 0 < t < 1 $ and $ x,y \in I $ we have that $ f(tx + (1-t)y) \le tf(x) + (1-t)f(y)$. Prove a function is convex if and ...
0
votes
1answer
25 views

Cone of convex solutions

I have been reading a paper, on monge-ampere type equations, and the existence of a unique convex solution has been proven to exist in $C^{3,\alpha}(\Omega)\cap C^{2,\alpha}(\overline{\Omega})$, for ...
0
votes
1answer
15 views

extension of Legendre transform of a function to a larger domain

Let $\Omega,\Omega^*$ be bounded domain in $\mathbb{R}^n$ and $u_0$ be a uniformly convex function define on $\Omega$. Suppose the gradient of $u_0$ maps $\Omega$ into a subdomain of $\Omega^*$, i.e. ...
0
votes
1answer
23 views

Calculating Legendre Transform

Let $\Omega,\Omega^*$ be bounded domain in $\mathbb{R}^n$, $B_r(y_0)$ is a small ball of radius $r$ center at $y_0\in\Omega^*$, in $\Omega^*$ define a function $\psi(y)=-\sqrt{(r^2-|y-y_0|^2)}$ on ...
2
votes
2answers
34 views

Proving convexity

I ask you please some help with this problem: Let A $\subseteq$ R$^n$ be a convex set and $C(A)$ = {$\lambda$x, $\lambda \in \mathbb{R}$, $\lambda \geq 0$, x $\in$ A}. Prove that $C(A)$ is convex. ...
0
votes
2answers
53 views

Regularization vs. Inequality Constraint

For what values of a regularization parameter $\alpha$, there is an equivalent inequality constraint in convex optimization? In particular, in the convex optimization problems below $$ \text{ Problem ...
1
vote
1answer
41 views

Rate of convergence of an exponential function

If I have a function $$f = \exp(\sqrt{n} \cdot \frac{\sqrt{\log{n}}}{\sqrt{n}-\sqrt{\log n}}),$$ I can notice, that $$\lim_{n \to \infty} f = \infty,$$ but also I can notice that it goes very slowly ...
1
vote
1answer
20 views

Supremum of convex lipschitz functions.

Let $f_i:K\to R, i\in I$ be a family of convex, equi-Lipschitz functions on some compact subset $K$ of $\Bbb R^n$. Is it true that $\sup f_i$ is also Lipschitz continuous(assuming that the sup ...
1
vote
1answer
29 views

Linear constraint in convex optimization

Is it true that the solution to a linearly constrained convex minimization problem can only be placed on the boundary of the constraint set, for any nonlinear convex objective, e.g. $$ \min_x f(x)$$ ...
0
votes
1answer
23 views

Is it possible to convexify this cone constraint?

General question An SOCP constraint is given by: $$ \| A_i \mathbf{x} + b_i\| \leq \mathbf{c}_i^T \mathbf{x} + d_i.$$ I have the following constraint: $$ \| A_i \mathbf{x} \| \geq d_i.$$ Is it ...
1
vote
1answer
17 views

Show that $\mathcal{C}(A)$ is the smallest convex of $E$ containing $A$.

Let $E$ be a $\mathbb{R}$-vector space, and $A$ a nonempty subset of $E$. Show that $$\mathcal{C}(A) = \biggl\{\sum \limits_{k=1}^n \lambda_kx_k \biggm| n \in \mathbb{N}^*, (x_1,\dots,x_n) \in ...
0
votes
0answers
39 views

compact and convex set

I recently have worked on compact convex sets in the context of time series and my question is related to that. If we have a set $$ C=\{\beta_1 X_1 +\beta_2 X_2 +\phi H_1 , ...
0
votes
1answer
32 views

Projection onto Polyeder

I know how to projects onto a linear subspace of $\mathbb R^3$, but how to project a point $x$ onto an polyhedron given as the intersection of three halfspaces $$ \langle y_1, x \rangle \ge c_1 ...
0
votes
1answer
19 views

Series and concavity

If $u(x)$ is strictly concave, can I say: $$ \sum_{n=0}^{\infty} \left(\frac{1}{2}\right)^{n+1}\cdot u(n) < \infty. $$ I am having trouble finding counterexamples. Thanks.
0
votes
1answer
23 views

Convexity defined by Karamata inequality

Just as the Jensen inequality is used to define convex functions, can the Karamata inequality be used instead to define convex functions?
0
votes
1answer
31 views

Separate two convex sets with disjoint interior (in $\mathbb{R}^n$)

In $\mathbb{R}^n$, I know that if $A$ is a convex set and $b$ in the boundary of $A$. Then we can separate $A$ and $b$, which means there exists $f \in \mathbb{R}^n$ such that $f\cdot x \ge f \cdot b$ ...
1
vote
1answer
16 views

Properties concave functions

Is is true that if $f(x)$ is a concave function of $x$ with domain $C$, then $f'(a) \leq \frac{f(a)}{a}$ for any $a \in C$, where $f'(a)$ denotes the derivative of $f(x)$ with respect to $x$ evaluated ...
0
votes
1answer
27 views

regarding the concept of dual cone

When studying the covex analysis, I am not clear about the concept of dual cone. In the following graph, $\mathcal{K}*$ was the dual cone. I marked two points, the ...
1
vote
0answers
15 views

if convex or nonconvex function

There is an iteration recurrence relations between the argument. In fact, it is part of my optimization model . The equation F is convex or not convex? thank u
0
votes
0answers
21 views

Polar set and adjoint operator

I'm trying to understand the following statement: A bounded operator between Banach spaces $u:X\rightarrow Y$ satisfies: $$\textrm{inf}\{\;||u(B_X \cap S)||:S\subset X,\,\textrm{codim}S=k \; ...
1
vote
1answer
63 views

Convex optimization: affine equality constraints into inequality constraints

I have the following problem: \begin{equation} \begin{array}{cll} \displaystyle \min_{ \mathbf{x} } & & \displaystyle f(\mathbf{x}) \\ \mathrm{s.t.} & & \mathbf{x} \in \mathcal{C} \\ ...
2
votes
0answers
21 views

Convexity in each argument and directional derivative

Let $f(x,y)$ be a continuous function, convex in each argument separately. Does this imply the existence of one-sided directional derivatives in any direction? For example, does there exist (finite or ...
0
votes
0answers
19 views

Separating convex sets in a tvs $X$.

I got doubt with the proof of this theorem. Let $X$ be a tvs, $A,B \subset X$ with $A$ an open convex set and $B$ convex such that $A \cap B = \emptyset$. Then there exists $f \in X^*$ (where ...
0
votes
0answers
27 views

Union of all sets of optimal solutions to a perturbed linear programming problem

Please let me know if you have some ideas on how to approach this proof? I got stuck part-way through. The following linear program is a function of $\theta$, $ \begin{array}{ll} \min & c^\top x ...
0
votes
0answers
19 views

Proving function defined by algorithm is convex

I'm working on my bachelor thesis and I'm trying to prove a conjecture, but I seem to miss the hint that helps me. I have an algorithm that defines a function $f:\mathbb{R}_{\geq ...
1
vote
1answer
59 views

Prove that function is convex

How can it be proved that the function $f(x) = \ln \bigl(\sum\limits_{i=1}^{n} e^{x_{i}}\bigr) $ is convex?
0
votes
0answers
29 views

Prove the existing and uniqueness of a solution [duplicate]

Let function $f$ be differentiable and convex in $R^n$ . How can it be proved that $∀λ>0$ solution of system equations $f ′ (x)=−λx$ exists exclusively (∃and! ).
0
votes
2answers
45 views

To prove the existing and uniqueness of a solution

Let function $f$ be differentiable and convex in $R^{n}$. How can it be proved that $\forall \lambda > 0$ solution of system equations $f'(x) = -\lambda x$ exists exclusively ($\exists \hspace{3mm} ...
2
votes
0answers
43 views

What is the smallest possible angle of this polygon?

A convex polygon contains a square with side-length 1 and its smallest containing square has side-length 2. What is the smallest possible angle of the polygon? What is its smallest possible area? ...
1
vote
1answer
24 views

Concavity of a function

While I am reading a book I couldn't follow the following step. " By concavity of the function $x \sqrt{\log\frac{1}{x}}$ for $x \in (0,1)$ we have that " $O(x \sqrt{\log\frac{k}{x}})$ = ...
0
votes
0answers
33 views

Sufficient conditions for convexity using the right derivative

We have a function $f:[0,1] \rightarrow \mathbb{R}$ that is continuous on $[0,1]$ with a non-decreasing right derivative everywhere in $(0,1)$. Is this definitely sufficient to show that $f$ is convex ...
1
vote
1answer
77 views

A a.e. strongly convex function

Suppose that $f=f(x)$ is strongly convex a.e. for $x\in\mathbb{R}$, i.e. there exists $\epsilon>0$ such that $f''(x)\geq\epsilon>0$ a.e. for $x\in\mathbb{R}$. Then there exists ...
3
votes
1answer
77 views

Proof that a set is convex

$$k\in \mathbb{R}_{+}$$ $$M=\left \{ (x_1,x_2)\in \mathbb{R}_{++}^2 \mid x_1 x_2\geq k\right \}$$ Prove that the set $M$ is convex. A hint is given (quoted from the text): We could choose to ...
1
vote
0answers
14 views

Begin study of convex algebraic sets in complex projective space

Where should I begin the study of convexity of (semi-)algebraic sets? In other words, projective varieties defined by polynomials of complex variables. The long-term goal is to study optimization in ...
0
votes
0answers
22 views

Dual convex pairs

I am currently trying to understand a certain proof. The author uses the term dual convex pair for a pair $(\phi,\psi)$ of convex functions defined on subsets $X,Y$ of $\mathbb R^n$ satisfying: $$ ...
2
votes
1answer
44 views

A question about norm for bounded linear transformations

Let $H$, $K$ be Banach spaces, and let $A: H \rightarrow K$ be a bounded linear transformation. Its norm is defined by: \begin{equation} \|A\| = sup\{\|Ah\|_K: \|h\|_H \le 1\} \end{equation} How to ...
2
votes
0answers
118 views

Convex subsets, Normed spaces, Separating hyperplane

I'm trying to understand the proof of a theorem taken from a textbook. Theorem: If $S_1,S_2$ are disjoint non-empty convex subsets of a real vector space $X$ (which may be infinite dimensional) then ...
0
votes
1answer
20 views

Deriving projection operator for an affine set

Given an affine set $Ax=b$, the Projection operator to this set is $$P(z) = z - A^{T}(AA^{T})^{-1}(Az-b)$$ which is also affine. How is this derived?
0
votes
0answers
17 views

Robust LP question using box uncertainty model

I am trying to solve this robust LP problem by writing it as a QP $$\min_x x^TSx : \mu \leq r^T x , Ax \leq b$$ Under Box uncertainty model: $$R = \{r : \| r - \hat{r}\|_\infty \leq \rho\}$$ Here ...
0
votes
1answer
29 views

What is the shape of all convex combinations of $\geq$ five vectors in $\mathbb{R}^3$?

The convex combinations of two linearly independent vectors in $\mathbb{R}^3$ span a line. The convex combinations of three linearly independent vectors in $\mathbb{R}^3$ span a solid triangle. The ...