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)

0
votes
0answers
31 views

proof of the existence of spherical sections of ellipsoids

i want to prove : Let L be proper ellipsoid with the origin as center in $E^{2m-1}$ .There exists a subspace $E^m$ such that $E^m$ intersects $L$ is an m-dimensional sphere it is proven by Dvoretzky ...
0
votes
0answers
23 views

what is the meaning of asphericity of convex set in a linear normed space?

I am trying to understand the definition of spherical to within $\epsilon$ for a convex body in a linear normed space, as given in Aryeh Dvoretzky's paper [1] (section 2, page 203): A convex set ...
0
votes
0answers
11 views

A question Kolmogrov's generalized inequality for projection onto convex sets

Kolmogrov's inequality says that, if $C$ is a convex set, and $P_C(x)$ is an operator for projecting point $x$ into the convex set $C$, if $z = P_C(x)$, then for any $y \in C$ we have $$ (z - y).(x - ...
0
votes
1answer
19 views

Why is it a borel set on the boundary of the unit ball of $E^n$?

Given $C$ convex body (compact convex set with non-empty interior points) in $E^n$ symmetric about the origin and containing the unit ball. Let $A(r)$ denote ,for every real $r >1$, the subset of ...
0
votes
0answers
20 views

Subgradient of a specific norm

Suppose I have vectors $x, x_1 , x_2 \in \mathbb{R}^p$ . Let $f(x) = \| \mbox{ }\|x - x_1\|_1 , \|x - x_2\|_1 \|_\infty$. How do we characterize the sub-gradient set $ \dfrac{\partial}{\partial x} ...
0
votes
1answer
45 views

New variable in a convex optimization problem

Consider the convex optimization program $$ \min_{x \in X } x^\top P x + p^\top x \quad \text{ sub. to: } Ax = b $$ where $X \subset \mathbb{R}^n$ is compact, $P \succ 0$, $A \in \mathbb{R}^{m \times ...
3
votes
2answers
148 views

Gradient-descent algorithm always converges to the closest local optima?

Assume $f(\vec x)$, which is Lipschitz continuous, has two local optima $\vec x_1^*$ and $\vec x_2^*$( $\vec x_1^*$ is the global minimum). We start the gradient-descent algorithm from $\vec x_0$ and ...
0
votes
1answer
16 views

Question about strongly convexity and affinity

For a function $f$, it is said to be strongly convex if for all $x,y$ \begin{equation} (\nabla f(x) - \nabla f(y) )^T (x-y) \ge m \|x-y\|_2^2 \end{equation} for a constant $m \ge 0$ Is it called ...
0
votes
2answers
48 views

How to find the polar dual of $\{(x,y):y\geqslant x^2\}$ in $\Bbb R^2$? [on hold]

How to find the polar dual of $\{(x,y):y\geqslant x^2\}$ in $\Bbb R^2$? If the polar dual of a set $A$ is $A^*=\{x\text{ in }\Bbb R^2:ax\leqslant 1\text{ for all }a\text{ in }A\}$.
0
votes
1answer
17 views

Optimality conditions in convex programming

I'm reading about Zero-order conditions in Nonlinear Programming and the following confuses me (my questions are below the theory): Consider the set $\Gamma \subset E^{n+1} = \{(r,\textbf{x}): ...
0
votes
0answers
15 views

Let $x \in \mathbb{R}^N$, $Y \in \mathbb{S}_+^N$, is $x^TYx$ convex?

Let $x \in \mathbb{R}^N$ is a vector, and $Y \in \mathbb{S}^N_+$ is a positive definite matrix Is $f(x,Y)=x^TYx$ convex over the space $\mathbb{R}^N \times \mathbb{S}^N_+$?
0
votes
1answer
13 views

Understanding convex hull

I'm having trouble understanding the definition of convex hull. Can somebody give me an example? For example if I have the real convex set $(a,b)$ then what is its convex hull? Is it $(a,b)$ or is it ...
1
vote
1answer
23 views

Prove or disprove a statement about testing the convexity of a set using the vertices

Assume we are working in $\mathbb R^d$. Let $A=\text{Conv}(V)$, the convex hull of $V$. Also $B=\text{Conv}(W)$. I am in a situation where I can prove the following: the line segment joining $v$ and ...
0
votes
1answer
377 views

Convex conjugate of $\ell_1$ and $\ell_2$ norm

Given a function $f$, we can define a function $f^{*}$, called the convex conjugate (also known as the Fenchel conjugate) of $f$ as follows: $$ f^*(\vec{z})= \sup_{\vec x \in \mathbb ...
-1
votes
2answers
55 views

How to approximate this large sum of exponential terms

Is there any way to approximate the following sum: $$ \sum\limits_{i_1=1}^N\sum\limits_{i_1=2}^N \cdots \sum\limits_{i_k=1}^N \cdots\sum\limits_{i_N=1}^N \exp(-r_{i_1}-r_{i_{k+1}}-r_{i_{2k+1}}- ...
0
votes
1answer
22 views

On level set of concave function

The problem is to show the following: Let $\varphi$ be a closed concave function, and $M=\max_{x \in \mathbb{R}^d} \varphi(x)$. Let $D_r:=\{\varphi\geq r\}$ be the level set. Then given $r \leq s ...
3
votes
2answers
245 views

How to prove that the following function is convex?

I want to prove convexity of the following function: $$f(x) = log_x \left(1 + \frac{(x^a-1)(x^b - 1)}{x-1}\right)$$ for any fixed $a, b \in (0, 1)$ and: $x\in(0,1)$ $x\in(1, \infty)$ I'm trying ...
0
votes
1answer
30 views

Show that $L^p$ norm is logarithmically convex as a function of $p$

Let $\Omega \subset \mathbb{R}^n$ be an open, bounded domain. Let $u : \Omega \to \mathbb{R}$ be measurable with $||u||_\infty < \infty$. For $p \in [1, \infty)$, define $$\Phi_u : p \mapsto ...
3
votes
1answer
54 views

How to prove Godunova's inequality?

Let $\phi$ be a positive and convex function on $(0,\infty)$. Then $$\int_0^\infty \phi\left(\frac{1}{x}\int_0^x g(t)\,dt\right)\frac{dx}{x} \leq \int_0^\infty \phi(g(x))\frac{dx}{x}$$ The ...
1
vote
1answer
21 views

Reference for a property of convex function

Let $F:\mathbb{R} \to \mathbb{R}$ be a continuously differentiable function. It is known that if $F$ has a strict local maximum, then it is not a convex function. I just would like to ask you for a ...
6
votes
1answer
61 views

Name of a shape that is intersected once by each ray that starts at a given point

Is there a particular name for a shape that is intersected exactly once by each ray that starts at a given point? To illustrate: I'm looking for a name for shapes like the left one in this image: ...
2
votes
1answer
31 views

Equations for interior of platon solids

It is well known that for platon solids: The interior of cube a.k.a. hexahedron can be described with equation $\max\{|x|,|y|,|z|\}<a$ The interior of octahedron - $|x|+|y|+|z|<a$. But what ...
3
votes
2answers
1k views

KKT and Slater's condition

I was studying Stephen Boyd's text book and got confused in the KKT part. The book says the following: "For any convex optimization problem with differentiable objective and constraint function, any ...
0
votes
0answers
20 views

Simplicial cones and simplex cones

In Ewald's book Combinatorial Convexity and Algebraic Geometry, we find the following definition. 1.8 Definition. A cone $\sigma=\operatorname{pos}\{x_1,\dots,x_k\}$ is called simple or a simplex ...
14
votes
1answer
204 views

Legendre Transformation of a Lagrangian in Classical Mechanics

I have some questions about the Legendre Transformation of a Lagrangian in Classical Mechanics to the Hamiltonian: We start with a Lagrangian $L(q,\dot{q})=\frac{\langle \dot{q} , \dot{q}\rangle }{2} ...
1
vote
1answer
30 views

Show that the ellipse and the hyperbola are convex

In Spivak's chapter on differentiation, he asks the reader to prove that the tangent line to an ellipse or a hyperbola intersect the figure at exactly one point. How is this done most elegantly? I ...
2
votes
1answer
55 views

Solving $ \inf \left\{ F[\nu] : \nu \in L^2 , \nu \geq 0, \int _0 ^1 \nu=1\right\}$

Let $\phi \in \mathcal ( [0,1]^2)$ symetric , can we find a solution to the following minimisation problem? $$ \inf \left\{ F[\nu] : \nu \in L^2 , \nu \geq 0, \int _0 ^1 \nu=1\right\}$$ with $$ ...
0
votes
0answers
17 views

closed form solution of a particular convex program

I wish to know if there is a closed form solution of a program of the following form $\max_w x^Tw \text{ such that } \tau_2\| w \|_2 + \tau_1 \| w \|_1 \leq 1, ~\ \tau_1, \tau_2 > 0$ When either ...
0
votes
1answer
18 views

Sum Of 2 Convex is affine. Prove 2 functions are affine

Let here be two convex functions: $f(x)$ and $g(x)$ let there be two real numbers: $a$ and $b$ so it is known that: $f(x) + g(x) = ax + b$ Prove that $f(x)$ and $g(x)$ are both affine *meaning that ...
0
votes
1answer
23 views

Show convexity of $f$ in $(x,y)$

Suppose $h$ is a convex function. Let $x$ and $y$ be vectors of possibly different lengths, and $A$ a matrix. Show that the function $f$ defined as $$ f(x,y) = h(y) \qquad Ay=x\\ \qquad \qquad \infty ...
1
vote
2answers
37 views

Existence of function $f:R^2 \rightarrow R$ s.t. f is convex in x- and y- directions and f has multiple minima.

Does there exist a function $f\colon \mathbb{R}^2 \rightarrow \mathbb{R}$ such that (1) for all $(x,y) \in \mathbb{R}^2$, f is convex in the x-direction and y-direction (2) $f$ has multiple ...
0
votes
1answer
35 views

Convexity of Norm of Max

Let $p \ge 1$. Show the convexity of the function $h:\mathbb{R}^k \rightarrow \mathbb{R}$ defined as: $$h(\textbf{z})=\left(\sum\limits_{i=1}^k \max\{z_i,0\}^p \right)^{1/p}$$
3
votes
2answers
23 views

Composition of convex and power function

Let $g$ be a convex nonegative function, and $p\ge1$. To show: $f(x)=g(x)^p$ is convex. Let $h(x)=x^p$. Then clearly $f=h \circ g$. Denote $\tilde{h}$ as the extended-value extension of $h$, which ...
0
votes
1answer
32 views

Sufficient condition on convex function such that $f(x) > -\infty$ for all $x$.

Let $f : \mathbb R^n \to [-\infty, \infty]$ convex and let $f(\overline x) > -\infty$ for $\overline x \in \mbox{int}(\mbox{dom}(f)$. Show that $f(x) > -\infty$ for all $x \in \mathbb R$. ...
6
votes
1answer
286 views

Cones of positive semidefinite matrices generated by matrices of rank $1$

Let $S_n$ be the space of real $n \times n$ symmetric matrices and let $S_n^+$ be the convex cone of positive semidefinite matrices in $S_n$. The extremal rays of this cone correspond to the positive ...
0
votes
0answers
18 views

Proof of sufficient condition of existence of Lagrange multipliers

Consider the optimization problem $$ (P) \quad \inf\{ f(x) : g_i(x) \le 0, i = 1,\ldots, m, x \in \mathbb R^m \} $$ where $f, g_i : \mathbb R^n \to (-\infty, \infty]$ are convex and $0 \ne ...
0
votes
1answer
16 views

Question about relative interiors and convexity

Suppose that $C\subseteq \mathbb{R}^n$, such that $\operatorname{ri} C\neq \emptyset$ is convex and $\operatorname{cl} C$ is convex. Can we show that ...
1
vote
0answers
13 views

mid-point convex but not a.e. equal to a convex function

I recently stumbled upon Wikipedia's page on convexity (http://en.wikipedia.org/wiki/Convex_function#Properties) and there's reference to Sierpniski's theorem from which we can deduce that for ...
2
votes
1answer
16 views

Prove convexity of log modified bessel function

I need to prove that the modified bessel function of the second kind is log convex in the square of the argument. Specifically I'm interested in showing, $\log \mathcal{K}_0(\sqrt{x})$ (zero order) is ...
2
votes
2answers
158 views

isoperimetric inequality using Fourier analysis

I'm trying to prove an isoperimetric inequality, but I have absolutely no idea how to go about it. let $\Gamma$ be a closed plane curve parametrized by $\gamma(t) = (x(t), y(t))$ on $[-\pi, \pi]$. ...
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
1answer
27 views

The convexity of convex function's range

Given a convex function $f\colon X \to \mathbb R$ with convex domain $X \subseteq \mathbb R^n$, is the range of $f$ a convex set also?
2
votes
1answer
24 views

Help understanding an application of Jensen's inequality

This is from the book Pattern Recognition and Machine Learning by Christopher Bishop. The author states the following form of Jensen's inequality: $f\left(\int{xp(x)dx}\right) \leq \int{f(x)p(x)dx}$ ...
0
votes
1answer
9 views

written $h(t)$ versus two convex functions

given a function $h(t)$ is it possible to written it as a difference of two convex functions $h_1(t)$ and $h_2(t)$ as follow? $h(t)=h_1(t)+h_2(t)$. To clarify, every function for example $g(t)$ can ...
1
vote
3answers
26 views

Inequality for concave functions

This shouldn't be too hard, but I'm stuck. Suppose $f$ is a concave function on the interval $[a,b]$, meaning $$\lambda f(x) + (1-\lambda) f(y) \leq f(\lambda x + (1-\lambda) y)$$ for every $x,y \in ...
1
vote
1answer
38 views

Proximal Mapping for maximum of linear and quadratic function

I was wondering if there is an efficient way of calculating the proximal mapping of the following function $f : \mathbb{R}^3 \rightarrow \mathbb{R}$, $b_i \in \mathbb{R}^3$, $c_i \in \mathbb{R}$ : $$ ...
15
votes
6answers
2k views

can any continuous function be represented as a sum of convex and concave function?

I read that any continuous function can be represented as a sum of convex and concave function, meaning for all $f(x)$, $f(x) = g(x) + h(x)$ where $g$ is convex and $h$ is concave. There could be ...
1
vote
1answer
232 views

proximal operator of infinity norm

What is the proximal operator of $||x||_\infty $? I know we have to take the subgradient and compute it but I am a bit stuck. Can anyone show me steps?
0
votes
1answer
21 views

Continuity of bounded and convex function on Hilbert space

I'm looking for the proof (or at least hints how to prove it) of theorem: Let $H$ be a real Hilbert space and let $f:H\to (-\infty,+\infty]$ be a convex function, bounded from above in some ...
12
votes
1answer
310 views

What is the probability of having a pentagon in 6 points

If the probability that $5$ random points in the plane whose horizontal coordinate and vertical coordinate are uniformly distributed on the interval $\left(0,1\right)$ occur to be the vertices of a ...