All Questions
6 questions
1
vote
1
answer
190
views
Proof of extended version of non-random "almost supermartingale"
In this question, a non-random version of "almost supermartingale" theorem is proved.
Here, I would like to extend/apply the non-random version to the slightly different situation. I wonder ...
1
vote
1
answer
271
views
Can we invoke "almost supermartingale" Theorem for deterministic sequences?
Perhaps stupid question.
Question: Can "almost supermartingale" theorem be equally applicable to prove the convergence of some algorithms solving non-random optimization problems?
Attempt ...
0
votes
1
answer
146
views
What to call a function that is negative on a set
Let $Y$ be a nonempty region in $\mathbb{R}^n$. I am designing an algorithm which given a point $x_0$ outside $Y$ in a finite number of steps lead to a point $x_n∈ Y$. The way I do it is that I have a ...
3
votes
1
answer
261
views
When is the optimum of an optimization problem affine in the constraint parameter?
While working on a variational problem I have reached to the following question:
Let $f:(0,\infty) \to [0,\infty)$ be a $C^1$ function satisfying $f(1)=0$. Suppose that $f(x)$ is strictly increasing ...
1
vote
1
answer
195
views
Is the minimum of a constraint optimization problem differentiable in the constraint parameter?
Let $h:\mathbb R^{>0}\to \mathbb R^{\ge 0}$ be a smooth function, satisfying $h(1)=0$, and suppose that $h(x)$ is strictly increasing on $[1,\infty)$, and strictly decreasing on $(0,1]$.
Let $s&...
0
votes
0
answers
42
views
What (analytical or numerical) method can I use to solve scalar optimal problem?
I got the following optimization problem in mind and I am looking for some (analytic or numerical) methods to solve it. Can anyone have any ideas? Here is problem
\begin{aligned}
& {\text{...