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
33 views

A property of concave functions

If $\phi$ is a concave functions (that is $-\phi$ is convex) with $\phi(1)=0$ why is it that $\phi(x)\le x-1$?
2
votes
0answers
43 views

Affine functions as equality constraints in convex optimization problems

I am studying on an introduction to convex optimization problems. When defining a convex optimization problem, we have a convex object function, $f(x)$, a set of convex functions $g_i(x)$ where the ...
0
votes
1answer
28 views

About hyperplanes on the boundary (with no $C^1$ regularity ) of compact convex sets

I am reading a paper and the authors use the following property: "Let $K$ a compact and convex set in $R^n$ with nonempty interior. Let $x_0 \in \partial K$ and suppose that the boundary is not ...
0
votes
1answer
26 views

Existence of a unique maximizer of a strict quasi-concave function defined over a convex set

Set $S \subset \mathbb R^2$ is compact and convex. A typical element of $S$ is $s=(s_1,s_2) \in S$. Also, $d \in \mathbb R^2$ is a fixed element such that there exists $s \in S$ such that $s \gt d$. ...
3
votes
1answer
88 views

Axiomatic Bargaining: Nash's Solution

The following text is from the book: Bargaining and Markets by Osborne and Rubinstein, Academic Press Inc. Page 17 under the chapter The Axiomatic Approach: Nash's Solutions:. Two individuals can ...
1
vote
2answers
34 views

Convexity and concavity of discontinuous functions

QUESTION F(x) =-x for x>=0 and F(x)=x for x<=0 Is the function convex/(strictly), concave/(strictly) I have attempted the answer but got strictly concave but isnt a discontinuous function meant ...
0
votes
0answers
34 views

subdifferential and Legendre transform

I have a problem with the following exercise from Evans, Partial Diff. Eq., Chapter 3, problem 6: Let $H:\mathbb R^n\to\mathbb R$ be convex. We say $q$ belongs to the subdifferential of $H$ at $p$, ...
0
votes
1answer
16 views

If $s_1 +s_2 \gt 1$ and $(t_1,t_2)$ be a convex combination of this with $(0.5,0.5)$ then show that $t_1t_2 \gt 0.25$

Let $(s_1,s_2)$ be such that $s_1 + s_2 \gt 1$. Let $(t_1,t_2)=((1-\epsilon )(0.5) + \epsilon s_1 , (1- \epsilon)(0.5) +\epsilon s_2)$, where $0< \epsilon \lt1$. I need to show that for $\epsilon ...
1
vote
1answer
46 views

Projected Area vs. Surface Area of a 3D Set

(In what follows, I'm making up the nomenclature as I go along, so please pardon anything nonstandard.) Suppose I have a set of points $A \in \mathcal{R}^3$ which is compact, convex, and simply ...
4
votes
1answer
64 views

(still open) For what $X$ do we have $\|XA\|_{1} \leq 1$ for a given $\|A\|_{1} \leq 1$.

All matrices are real. By $\| \cdot \|_1$ I mean a matrix norm induced by the vector norm $L_1$, i.e. the max of the column sums of absolute values. The matrix $A$ is given and we have $\|A\|_{1} ...
-3
votes
4answers
337 views

There is a ray from each point of unbounded convex set that is inside the set. [closed]

Let $A$ be a non-empty convex, unbounded set in $\mathbb R^n$. Prove that for each point $a \in A$, there is a non-zero vector $h \in \mathbb R^n$ such that $l = \{x \in \mathbb R^n \mid x=a+th,\ ...
2
votes
0answers
39 views

If $A$ is a convex set in $R^n$ with a limit point $x_0$, can we have an open line segment in $A$ with $x_0$ its limit point…? [closed]

If $A$ is a convex set in $R^n$ with a limit point $x_0$ outside $A$ can we have an open line segment in $A$ with $x_0$ its limit point...?
5
votes
2answers
94 views

A question about convex open set in a topological vector space.

Supose $E$ is a topological vector space(may not be Hausdorff). $U\subset E$ is an open set such that $U+U=2U$. How to show $U$ is convex? I can see if $E$ is $T_1$,then $E$ should be Hausdorff. ...
3
votes
2answers
30 views

Showing convexity, having trouble showing positive definiteness

I am interested in showing the convexity of $$-\log(-f(\pmb{x}))$$ for $f: \mathbb{R}^{n}\rightarrow \mathbb{R}^{-}$ and $f$ convex. If we let $\nabla f$ denote the column vector where the $i$th ...
1
vote
0answers
34 views

Epigraph of closed convex hull of a function

$\newcommand{\co}{\overline{\operatorname{co}}}\newcommand{\epi}{\operatorname{epi}}$ Let $X$ be an n.v.s and $f: X \to \mathbb{R} \cup \{+\infty\}$ and define $$\co f(x) \doteq \sup_{\substack {x^* ...
0
votes
1answer
31 views

Prove concavity without testing the second derivative..

Consider a function $F(L)=(L-L^2a)T^{L-1}$, where $0<L<\frac{1}{a}$. The constants $a$ and $T$ may take values over $]0,1[$ and $[0.01,0.1]$, respectively. The first derivative of $F$: ...
0
votes
1answer
30 views

Confusion about Concavity

Simple question. The function g of a single variable is defined by g(x) = f(ax + b), where f is a concave function of a single variable that is not necessarily differentiable, and a and b are ...
1
vote
2answers
30 views

About supporting hyperplanes of convex sets

Let $K \subset R^n$ a convex set, and $x \in \partial K$ such that that there exists a closed ball $B(x_0,R) \subset K$ of positive radius with $x \in B(x_0,R) $. My intuition tells me that there ...
0
votes
0answers
27 views

How to show that the vertices of a convex hull are given by these specific subsets…

We work over $\mathbb{R}^N$. Let $V$ be the corners of the unit cube $[0,1]^N$, or equivalently the set of vectors whose coordinates take values $0$ or $1$. Let $d:\{0, \ldots, N\} \to \mathbb{R}_+$ ...
0
votes
1answer
24 views

Confusion with a proof about the continuity of convex functions

I studying convex analysis and in my book I have the following statement and proof: Lets assume that $f:S\rightarrow \mathbb{R}, \;S\subset \mathbb{R}^n$ is a convex function. Then $f$ is ...
1
vote
1answer
22 views

Strictly convex set

When a function is strictly convex it has many desirable properties, most notably that it admits a unique minimum. I was wondering if there is anything desirable about a strictly convex set (meaning ...
1
vote
1answer
27 views

Optimisation over matrix entries

I was looking to write the KKT conditions to solve this optimisation problem. $$\min_{\substack{\sum_j x_{ij}\le k_i \\ i=1,2,\ldots N}} a^\top (I-X)^{-1} b $$ Since there are $N^2$ decision ...
0
votes
0answers
22 views

Projection onto a matrix where the diagonals are identity matrix

I'm trying the understand intersection of convex sets given in "Convex Optimization - Boyd" which I'm also trying to code in cvx. The two convex sets I'm trying to find the intersection are given ...
0
votes
0answers
15 views

Efficient way to compute the strong convexity modulus of a function?

I have a strongly convex function $f:X\to\mathbb{R}$, where $X\subseteq \mathbb{R}^n$, with strong convexity parameter $\sigma>0$. By definition $f$ satisfies, for all $x,y\in X$ and $t\in[0,1]$, ...
1
vote
0answers
23 views

When is the normal cone to a closed convex set in a locally convex set maximal monotone?

Let $X$ be a locally convex set with the following property: (P) $\forall C\subset X$ closed convex, the normal cone $N_C$ is maximal monotone as a multi-valued operator from $X$ to its topological ...
1
vote
1answer
75 views

Maximal intersection of slabs in $\mathbb{R}^n$ with a compact convex centrally symmetric set

Let $K \in \mathbb{R}^n$ be a compact convex set containing the origin and symmetric with respect to the origin. Let $S_i(t_i)$ be a finite set of slabs of various widths and orientations, translated ...
1
vote
1answer
26 views

Hausdorff Distance between Subdifferential sets

Suppose I have two convex functions $f$ and $g$ mapping $\mathbb{R}^{n}\to\mathbb{R}$ (so they are 'more' than proper). Suppose $\|f-g\|_{\infty}<\epsilon$, the sup-norm. In particular, the ...
1
vote
0answers
48 views

Proving/deciding concavity of a function of two variables

I would like to formally prove that the function $f(x,y) = \frac{(c+1)e^{-x}(xe^{x+y}+y)}{(c+2)(e^{x+y}-1)+e^y} $ is concave ($ c>2$ is a constant, and both $x,\, y \in \mathbf{R_+}$). Plots of ...
0
votes
1answer
29 views

If -log(f) is convex, is f automatically convex?

Say I want to know if $f(x)$ is convex. Can I apply any convex function, strictly increasing function to it and preserve convexity? Say $f(x),g(x)$ are convex and strictly positive and I want to know ...
1
vote
2answers
32 views

an interior point of a convex set

How can we prove a point is an interior point of a convex set, considering we don't have all of the extreme points of the given convex set ? or How can we find an interior point of a convex set, ...
1
vote
1answer
31 views

Quantitative aspect of Caratheodory theorem

Let A be a compact convex set in n-dimensional space. [ Of principal interest is n > 2 . ] A result of Caratheodory states that A is equal to the union of its simplices (i.e. simplices with all ...
6
votes
3answers
3k views

How $x^4$ is strictly convex function?

I hear that $f(x)=x^4$ is a strictly convex function $\forall x \in \Re$. However, strict convexity condition is that the second derivative should be positive $\forall x \in \Re$. For the mentioned ...
0
votes
1answer
36 views

checking for convexity/concavity of a function

i'm having some problem in establishing the convexity/concavity of the following two functions. Check for the concavity/convexity of the following functions: (a) ...
1
vote
1answer
30 views

Relative Interiors of polyhedra

***Source article: Magnanti, T. L., & Wong, R. T. (1981). Accelerating Benders decomposition: Algorithmic enhancement and model selection criteria. Operations Research, 29(3), 464-484
3
votes
0answers
28 views

Characterization of concave function on $\mathbb{R}^N$

I need help with the following problem, I have no idea how to proceed: Let $u \colon \Omega \subseteq \mathbb{R}^N \to \mathbb{R}$ a continuous function, where $\Omega$ is open, connected and ...
1
vote
0answers
12 views

tangent cone of a projection

I am stuck with what looks like a basic problem from convex analysis and I don't seem to have the answer. Any pointers or insights would be of great help. Suppose $K$ is a closed convex set in ...
0
votes
1answer
11 views

Prove that $\log I_{\nu}(x)$ is concave

As the title suggests I need to show that the log of the modified bessel function is concave. When I graph it, certainly seems to be the case. So far I have that: $$ y=\log I_{\nu}(x)\\ ...
0
votes
0answers
34 views

intuitive question about the boundary of a set

Consider $\Omega_1, \Omega_2$ two convex, bounded domains in $R^n$ with $\Omega_1 \supset \overline{\Omega_2}$ suppose that $\operatorname{dist}(x, \partial \Omega_2) =\min_{y \in \partial \Omega_2} ...
0
votes
0answers
37 views

Describing the minimizers of this function

Consider the following continuous function over $x$, with $a,b>0$: $$f(x)=\begin{cases} ax-\sqrt{x} & \text{for }x\leq b^{2}\\ ab\sqrt{x}-b & \text{for }x>b^{2} \end{cases}$$Note that ...
0
votes
1answer
29 views

How to know if a function is not “too convex”?

In my math courses, I have never come across the idea of being "too convex", but this is from an economics course. Essentially, you have some function $P(Q)$, where $Q>0$. The model tells us to ...
0
votes
0answers
20 views

relative interior and the affine map

In the convex analysis book by Hiriart-Urruty &Lemarechal, Proposition 2.1.12 states $ri [A(C)] = A(ri C)$. Where $ri$ is the relative interior and $A: \mathbb{R}^n \to \mathbb{R}^m $ is an ...
1
vote
0answers
15 views

Why $\frac{\partial u((1-t)x+ty)}{\partial t} \mid_{t =0} \geq 0$, if $u(x) \geq u(y)$ and $u$ is quasiconcave and differentiable?

Let $u$ be quasiconcave and differentiable at $x$. If $u(x) \geq u(y)$, then how to show that $\frac{\partial u((1-t)x+ty)}{\partial t} \mid_{t =0} \geq 0$? $u$ is quasiconcave means that for all ...
7
votes
1answer
179 views

A short question about the convexity of a function

Let $x$ and $y$ be two numbers; $0\leq x \leq 1$ and $0\leq y \leq 1$ satisfying $$\mathcal{X}\times \mathcal{Y}=\left\{(x,y):\sum^{\lfloor k\rfloor}_{i=0}\binom{n}{i}(1-y)^{i} y^{n-i} +\sum^{\lfloor ...
2
votes
1answer
51 views

Uniqueness of projection in a Banach space

Let $X$ be a Banach space, $M$ be a subspace of $X$ and $x \in X$ be any vector in $X$. Consider $\displaystyle \hat{x}_M=\arg \inf_{m\in M}\|x - m\|$. Under what conditions for $l_p$ norms $p = ...
1
vote
1answer
30 views

Convexity problem

Let $S$ be a convex set. If $x\in$ int$S$ and $y\in$ cl$S$, show that relint[x,y] $\subset$ int$S$. I easily proved this for a case where y is in the interior of S, but am stuck if y is in the ...
0
votes
1answer
27 views

Is the function (sum-of-squares) / sum convex on nonnegative input?

Let $$f \colon \mathbb{R}_{> 0}^n \to \mathbb R$$ be defined by $$f(x_1,\dotsc,x_n) = \begin{cases} 0 &\text{if }x_1 = \dotsb = x_n = 0\text{,}\\ \frac{\sum_i x_i^2}{\sum_i x_i} ...
1
vote
1answer
57 views

An exercise on convex decreasing function properties

A function f$(x)$ defined for $x\geq0$. It is positive, decreasing, convex and log-convex: $\frac{d^2}{dx^2}\log[f(x)]>0$, $f(0)<1$. Can we prove that $f''(x)x+f'(x)>0$ for sufficiently ...
0
votes
0answers
45 views

$f:D\subset \Bbb R^2 \rightarrow \Bbb R$, where $D$ is a compact and convex set, reaches it maximum at $int(D)$

I'm trying to prove that if $D$ is a compact and convex (for every two elements of $D$, the line that connects them is contained in $D$) then: If $f:D\subset \Bbb R^2 \rightarrow \Bbb R$ and at ...
1
vote
1answer
19 views

Verifying a production set is a convex cone

This comes from a paper that I am reading: For $i=1,2$, suppose that $F_i(\cdot,\cdot)$ satisfies the assumption: $F_i(K_i,L_i)$ is defined for all $K_i\geq 0$, $L_i\geq 0$. $F_i(0,0)=0$. ...
4
votes
0answers
80 views

Convexity of $S=\left\{ \frac{\underline{x}^HA\underline{x}}{\underline{x}^H\underline{x}} , \underline{x} \in \mathbb C ^{n}\right\}$

i've to prove that the following set is convex: Let $A \in \mathbb{C}^{n \times n}$ $$S=\left\{ \frac{\underline{x}^HA\underline{x}}{\underline{x}^H\underline{x}} , \underline{x} \in \mathbb C ...