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

Impact of constraints on convex optimization

Let me start by saying I know almost nothing about optimization so please bear with me. Basically, I am wondering whether it is possible to solve a problem with two constraints by solving the problem ...
0
votes
2answers
29 views

Question on convexity

If I have a function $f:\mathbb{R}^n\to\mathbb{R}$ that is convex in ${\bf x} = (x_1,x_2,\ldots,x_n)$ and strictly convex in one of the variables, say $x_1$, then is $f({\bf x})$ strictly convex in ...
4
votes
0answers
157 views

Properties of the square norm in Banach spaces

Let $X$ be a Banach space with its dual $X^*$. Consider the mapping $f: X\rightarrow \mathbb{R}$ given by $$ f(x)=\frac{1}{2}\|x\|^2. $$ We have know that when $X$ is a real Hilbert space ($X=X^*$) ...
0
votes
0answers
26 views

Gradient of the optimal point

Hope to ask a Q on S. Boyd's cvx book: (p.139) A point x is optimal iff x in X and My Q is: If x is optimal, the 1st order differentiation at this point should be zero. Gradient is like ...
0
votes
1answer
14 views

Continuity of convex functions at point out of domain

I have been studying the continuity of a convex function and having a trouble below: In some books, the authors defined the the continuity of a convex function $f$ even $f$ is not in $\mbox{dom }f$, ...
0
votes
1answer
38 views

A Simple Algorithm for Imposing Semi-definite Constraints

What is the simplest algorithm to implement, to impose semi-definite constraints? $\min_{X\succeq 0} f(X) $, where $X$ is an $n \times n$ symmetric matrix, and $f$ is a general smooth convex ...
1
vote
1answer
10 views

Properties that guarantee quasiconvexity in $\mathbb{R}^n$

I have an open bounded connected domain $\Omega \subseteq \mathbb{R}^n$ and I would like to say that for every two $x,y \in \Omega$ there is a path $\gamma$ from $x$ to $y$ of length at most $C|x-y|$ ...
2
votes
1answer
31 views

Distance of convex combination of pairs of points in $\mathbb{R}^n$

Given 4 points $w,x,y,z \in \mathbb{R}^n$ define for $t\in [0,1]$ $f(t)=d(wt + (1-t)x, yt + (1-t)z)$. Is this function convex? I have found a proof by differentiating twice and calculating a lot but ...
0
votes
1answer
14 views

A Q about convex optimality criterion

Hope to ask about p. 139 of S. Boyd's cvx book: x is optimal iff x is in X (feasible set) and And the book use the following pic to illustrate: My Q is: why there is a negative sign '-' in ...
0
votes
1answer
21 views

Integral of increasing continuous function is convex

Suppose $g$ is increasing and continuous. Does it follow that $G(x) = \int_0^xg(y)dy$ is convex? Clearly $G'$ is increasing and continuous, and $G''\geq 0$ exists a.e., but I don't see how this ...
0
votes
1answer
19 views

Partial Ordering of proper cone K

$K$ in $\mathbb{R}^n$, and $K$ is a proper cone. Partial Ordering of $K$ : $x \leq_K y$ iff $y-x\in K$ (S. Boyd p. 43) My questions are: Does it require $x,y\in K$? If $x,y\in K$, it seems ...
0
votes
1answer
13 views

A Q about S.Boyd's CVX book p. 107

A Q about the following: (Come from S.Boyd's note) Note 1: y is a r.v with log-concave pdf "p(y)". My Qs are: What is the f(x) in the proof? It is marginal pdf or cdf or expected value? It ...
0
votes
0answers
15 views

The key step to prove log-convexity is preserved under sums

In S. Boyd textbook p.105 (button): (cvx = convex) Let F = log f & G = log g are convex (i.e. Let f & g are log-cvx) (This guarantees f & g are cvx, since log-cvx is included in ...
0
votes
0answers
19 views

Example of sum of log-concave is not always log-concave

I know that sum of log-concave is not always log-concave. Could anyone provides me with an example to prove this? Like probability distribution fn (pdf) of normal distribution is log-concave; on ...
0
votes
1answer
21 views

Convex function that has a finite limit at infinity

Can someone give me an example for a convex function that has a finit limit at infinity ?
5
votes
1answer
97 views

A bounded subset in $\mathbb R^2$ which is “nowhere convex”?

Let $F : \mathbb S^1 \to \mathbb R^2$ represents a simple closed curve $C$ in $\mathbb R^2$. The Jordan curve theorem says that the curves bounds a interior domain $\Omega$ and $\partial \Omega= C$. ...
1
vote
2answers
28 views

A statement for convex sets

The following statement is true or false? Given a convex set $S$ then for any $y \in S$ and $\theta\in[0,1], \theta \in \mathbb R$ there exist $y_1,y_2 \in S, y_1 \ne y, y_2 \ne y$ such that ...
0
votes
0answers
20 views

Convex in $ \mathbb{R^n}$

Prove that: [A be a convexe part $(A\subseteq \mathbb{R^n})] \implies [\forall x_1,x_2,...x_n\in A ,\forall\alpha_1,\alpha_2,...\alpha_n\ge0 $ $with$ $ \ \alpha_1+\alpha_2+...+\alpha_n=1 ...
0
votes
0answers
20 views

Subdifferential boundary conditions

Let $\Omega \subset \mathbb R^d$ be a domain and $\Gamma$ be its boundary. Assume also that we have a convex (proper, lower semicontinuous) function $\phi \colon \mathbb R^d \to \mathbb R$. Now we ...
0
votes
1answer
21 views

Convex function almost surely differentiable.

If f: $\mathbb{R}^n \rightarrow \mathbb{R}$ is a convex function, i heard that f is almost everywhere differentiable. Is it true? I can't find a proof (n-dimentional). Thank you for any help
0
votes
1answer
20 views

Show homeomorphism between convex hull and unit ball?

In the proof of Schauder fixed point theorem in Evans' PDE book, he uses a claim that the convex hull $K$ of $N$ points $x_1,\dots,x_N$ in a convex compact subset $A$ of a Banach space $X$ is ...
0
votes
0answers
24 views

Total Variation minimization problem

Thanks for reading this thread. I have a object function, with constraints, I am trying to minimize. The object function is the Total Variation of an image. The Total Variation is defined as: ...
6
votes
2answers
186 views

About the hyperplane conjecture.

I have recently heard about the hyperplane conjecture and I would like to understand better the problematic behind this conjecture. The hyperplane conjecture: There exists a universal constant ...
0
votes
0answers
16 views

Cartesian product of relative interior sets

I couldn't prove the proposition that relative interior of cartesian product of two nonempty and convex sets is equal to cartesian product of relative interiors of these two sets.
1
vote
1answer
36 views

Is $f(H)=H^TH$ convex? $H$ is a $m\times n$ matrix

I tried to prove $f(H)=H^TH$ convex, where $H$ is a matrix. We know when $h$ is a vector, then $f(h)=h^Th$ is convex. Can I prove it using the following equation? $[\theta H_1 + (1-\theta) ...
0
votes
0answers
25 views

Is there any version of Jensen's inequality for quasiconvex function

I am looking for some generalization of Jensen's inequality for functions $g:\mathbb{R}^n \rightarrow \mathbb{R}$ where $g(x)$ is quasiconvex (or not convex). We known that for convex functions, ...
0
votes
2answers
27 views

Does one of these conditions for norms follow from the other?

The two conditions are: For all unit vectors $\mathbf{x}$ and $\mathbf{y}\hspace{-0.02 in}$, $\:$ if $\; \left|\left|\hspace{.03 in}\mathbf{x}\hspace{-0.05 in}+\hspace{-0.04 ...
0
votes
0answers
20 views

Folding in $\mathbb{R}^2$ - which area of modern geometry formalises this concept?

For any lines $L_1,...,L_n$ in $\mathbb{R}^2$ and $w_1,...,w_n \in \{-1,+1\}$ we can define a folding operation $F(L_1,...,L_n; w_1,...,w_n): \mathscr{P}(\mathbb{R}^2) \rightarrow \mathbb{R}^2$, ...
0
votes
1answer
50 views

Is this function strictly convex?

I think this function is strictly convex in the vector ${\bf x} = (x_1,x_2,x_3,x_4)$ but the fact that some terms are zero when variables take on the same values leaves me uncertain, i.e. when ...
1
vote
0answers
11 views

Checking convexity by looking at 2-dimensional cross-sections

If I have a closed set of n-dimensional points and I want to know if it's convex just by examining some set of 2-dimensional cross-sections (and checking each cross-section for convexity), how small ...
0
votes
0answers
42 views

Online convex programming: Projection followed by normalization

I have the following projected gradient descent online linear programming problem which has been well studied in www.cs.cmu.edu/~maz/publications/techconvex.pdf‎ $\mathbf{y}_{t+1}=\mathbf{w}_t - ...
0
votes
1answer
23 views

How can I prove this problem is quasiconvex?

I'm doing a convex optimization problem. It requires me to fit a rational function to an exponential function. I assumed the original problem would be a quasiconvex optimization problem and based on ...
1
vote
2answers
29 views

Minimizing a convex cost function

I'm reviewing basic techniques in optimization and I'm stuck on the following. We aim to minimize the cost function $$f(x_1,x_2) = \frac{1}{2n} \sum_{k=1}^n \left(\cos\left(\frac{\pi k}{n}\right) x_1 ...
0
votes
1answer
32 views

Strict convexity of the following function

I have a function that is of the form $C({\bf x}) = c_1\left(a_1x_1 + b_1x_1^2\right) + c_2\left(a_2(x_1-x_2) + b_2(x_1-x_2)^2\right) + c_3\left(a_3(x_2-x_3) + b_3(x_2-x_3)^2\right)$ where each ...
0
votes
2answers
56 views

Solution in general for a seemingly simple problem

Let $\mathbb{S}$ be a closed, bounded, convex set in $\mathbb{R}^N$. Let $\mathbb{x}=[x_1,\dots,x_N]$ be any arbitrary vector in $\mathbb{S}$. Then what can we comment on the problem \begin{align} ...
1
vote
0answers
16 views

Proving convexity of the Schatten 1-norm

Is it possible to show that the Schatten 1-norm is convex by the definition of convexity? I can't seem to find any way to derive an expression of the sum or matrix of singular values of a convex ...
0
votes
1answer
24 views

Extreme points of a convex set

How do i find all extreme points of the set: $\displaystyle C=\{x\in\mathbb{R}^n | \sum_{i=1}^n |x_i| \leq 1 \}$? I guess that $x=0$ is an extreme point, but how can i show it and is it the only ...
0
votes
2answers
45 views

Convex function, sets and which of the following are true? (NBHM-$2014$)

Let $f:]a,b[ \to\Bbb R$ be a given function. Which of the following statements are true? a. If $f$ is convex in $]a,b[$, then the set $\tau=\{(x,y) \in\Bbb R^2| x\in ]a,b[, y\ge f(x)\}$ is a convex ...
1
vote
0answers
26 views

Convexity of composition of multi-dimensional functions

I am trying to determine the convexity of a composition of functions, $c$, defined as, $c(x) = f(g(x),h(x))$ where $f:\mathbb{R}^2\to\mathbb{R}$, $g,h:\mathbb{R}^n\to\mathbb{R}$, and ...
0
votes
1answer
44 views

How can the sum of two closed cones be not closed?

Can there be two closed cones $K_1$ and $K_2$ in $\mathbb{R}^3$ such that $K_1+K_2$ need not be closed?
0
votes
1answer
9 views

Conic hull of a proper function

Suppose $f$ is a proper function pn $\mathbb{R}^{n}$with $f(0)>0$.Now consider $$ g(x) = \text{inf}\{t: (t,x) \in \text{cl(cone(epi(}f)))\} $$ Can I always say that $\exists y \in \mathbb{R}^{n} : ...
0
votes
0answers
20 views

Difference between upper semicontinuity and outer semicontinuity

For a closed convex valued correspondence from $R^n$ to $R^n$, what is the difference between upper semi-continuity at a point $x$ and outer semicontinuity at a point $x$?
0
votes
0answers
14 views

What is a “symmetric convex function”?

I was reading a document (on doubly stochastic matrices) and they write : "a symmetric convex function $f \, : \, \mathbb{R}^{n} \, \longrightarrow \, \mathbb{R}$". I don't understand what "symmetric" ...
0
votes
1answer
20 views

Intersection of strictly monotone, convex functions on interval with two given intersections

Given two functions $f,g:[0,1]\rightarrow[0,1]$ that are smooth, strictly convex, strictly monotone s.t. $f(1)=g(1)=0$, $g(0)=f(0)=1$ and $f(x_0)>g(x_0)$ holds for some point $x_0$, does it follow ...
5
votes
4answers
98 views

Why is the projection of a closed polytope closed?

In general, projection of a closed set into a subspace does not result in a closed set. However, I was able to prove that in $\mathbb{R}^n$, the projection of a closed polytope (intersection of ...
3
votes
1answer
62 views

Algebraic Proof that a Disk is Convex

After searching on Google for a while, I cannot seem to find an algebraic proof that a disk is a convex set. Intuitively, this seems obvious: if you take any two points $x, y$ in a disk, then the line ...
0
votes
1answer
14 views

Problem with convex function

In Papadimitriou book I found a problem. If I know that function $f$ is a convex function, and I have values $x_2,...,x_n$, is function $g(x_1) = f(x_1,x_2,...,x_n)$ also a convex function? I know ...
2
votes
1answer
48 views

How to formally prove that f(x,y) is jointly convex if f(x,y)=h(g(x,y))?

I know that this function should be concave, I am working on the Hessian proof but I would rather use this property. I know that h(a) is convex and decreasing in a, and g(x,y) is linear, ...
1
vote
1answer
55 views

Invariant convex subset

Let X be a banach space and $T$ a bounded operator on X with $||T||$ less than or equal to 1. If $T$ is an isometry and $r(T)$<1 show that there is a closed convex non-zero proper subset $C$ of the ...
1
vote
3answers
190 views

How to prove that $e^x$ is convex? [closed]

I need a help with proving of $e^x$ function. We know $e^x$ is a convex function. $$f(c(x')+(1-c)(x'')) ≤ c\cdot f(x')+(1-c)\cdot f(x''), \quad 0 ≤ c ≤ 1$$ Thanks.