Search Results
Search type | Search syntax |
---|---|
Tags | [tag] |
Exact | "words here" |
Author |
user:1234 user:me (yours) |
Score |
score:3 (3+) score:0 (none) |
Answers |
answers:3 (3+) answers:0 (none) isaccepted:yes hasaccepted:no inquestion:1234 |
Views | views:250 |
Code | code:"if (foo != bar)" |
Sections |
title:apples body:"apples oranges" |
URL | url:"*.example.com" |
Saves | in:saves |
Status |
closed:yes duplicate:no migrated:no wiki:no |
Types |
is:question is:answer |
Exclude |
-[tag] -apples |
For more details on advanced search visit our help page |
Optimization with convex constraints and convex objectives; notions related to convex optimization such as sub-gradients, normal cones, separating hyperplanes
0
votes
2
answers
295
views
Representation of continuous, monotone, concave functions
Is there a characterization of all continuous functions $f:\mathbb{R}\rightarrow \mathbb{R}$ satisfying:
$f(0)=0$
$f$ is monotonically increasing
$f$ is concave
My intuition is that $f$ should admit …
2
votes
0
answers
320
views
Lipschitz min implies Lipschitzian argmin?
Let $X$ be a Hilbert space, and suppose that $f:X^2\rightarrow \mathbb{R}$ is a Lipschitz, supercoercive, convex function such that (for every $y \in X$) the set
$$
\operatorname*{argmin}_{x\in X} f(x …
1
vote
0
answers
48
views
Various definitions of coercivity
In this post one says that a functional $F:H\rightarrow [0,\infty]$ on an infinite-dimensional Hilbert space $H$ is (strongly) coercive if there exists a constant $k>0$ such that
$$
F(x)\geq k\|x\|_H^ …
0
votes
0
answers
40
views
Iterating partially-unconstrained optimization with projection
Let $f:H\to \mathbb{R}$ be a strictly convex Fréchet differentiable, coercive function on a separable Hilbert space $H$ and let $C_1,C_2\subseteq H$ be closed and convex.
I want to optimize
$$
\tag{(A …
0
votes
0
answers
239
views
Limit of argmin of sum
Suppose that I know $f_n\rightarrow f$ and $g_n\rightarrow g$ are both continuous maps from a Complete Riemmanian Manifold $X$ to $\mathbb{R}$ which converge pointwise almost everywhere. Then is it t …
2
votes
1
answer
413
views
Echange of Infimum Integral with Pointwise Infimum
Setup
Suppose that $U$ is a subset of $L^{\infty}_{\mu}(\mathscr{F})\cap L^1_{\mu}(\mathscr{F})$ defined by
$$
f\in U \Leftrightarrow g(f(x))\leq M \mbox{ and } f \in L^{\infty}_{\mu}(\mathscr{F})\c …
4
votes
1
answer
120
views
Proximal Operator image of convex functionals
Let $\Gamma_0$ denote the set of lower-semi-continuous convex functionals on a Hilbert space $H$. What exactly is the image of $\Gamma_0$ under the proximal operator
$$
\begin{aligned}
&\Gamma_0\rig …
3
votes
1
answer
246
views
Measurable selection for argmin to distance
Let $Y$ be a Banach space and equip $Y$ with the weak topology. Now, let $X$ be a closed, bounded, and convex subset of $Y$ and suppose that the relative (weak) topology on $X$ is metrizable with met …
0
votes
1
answer
312
views
Gradient-descent "type" Methods for non-convex and non-smooth functions
Most (stochastic) "gradient descent" type algorithms (such as Nesterov-accelerated gradient-descent or ADAM) seem to be well-defined only for functions which are either:
lower semi-continuous + conve …
1
vote
0
answers
69
views
Soft: Lagrange Multiplier and Intersection of Thickened Sets
Suppose I have an optimization problem of the form
$$
\inf_{\{x \in \mathbb{R}^d: g(x)=0\}} f(x),
$$
for some convex function $f$ and non-convex l.s.c. function $g$.
Can we reinterpret the Lagrang …
1
vote
0
answers
264
views
Minimum Preserving Transformations [closed]
If $f:X\rightarrow Y$, $g:Y\rightarrow Y$ are functions and $g$ is monotone increasing function then
$$
\operatorname{argmin}_{x \in X} f(x)
=
\operatorname{argmin}_{x \in X} g\circ f(x) .
$$
X and Y …
2
votes
0
answers
42
views
Weak relaxation of a strongly lower semi-continuous functional
Let $F$ be a lower semicontinuous functional on a Banach space $X$, wrt its strong topology. Is there a known form for the relaxation (lower semicontinuous envelope) of $F$ with respect to the weak t …
3
votes
0
answers
93
views
Projection onto level set of convex functional
Fix a probability space $(\Omega,\mathcal{F},\mathbb{P})$ and let $F:L^2_{\mathbb{P}}(\mathcal{F})\rightarrow (-\infty,\infty]$ be bounded-blow, convex, lower semi-continuous, and not identically infi …
0
votes
0
answers
113
views
Weak derivative of projection onto probabilist's simplex
Let $\Delta_n:=\{x\in [0,1]^n:\boldsymbol{1}^{\top}x=1\}$ denote the probabilist's $n$-simplex and let $P:\mathbb{R}^n\rightarrow\Delta_n$ denote the (Euclidean) metric projection onto this simplex de …
2
votes
1
answer
391
views
Smoothness of Minkowski functional is equivalent to smoothness of boundary
Let $C\subseteq \mathbb{R}^n$ be a convex body containing $0$ in its interior. I recently read that Minkowski functional of $C$,
$$
f_C(x):=\inf\Big\{t>0:\frac1{t}\cdot x\in C\Big\},
$$
is $C^1$ if …