Skip to main content

All Questions

Filter by
Sorted by
Tagged with
1 vote
1 answer
212 views

Does coercivity/supercoercivity conjugates?

According to Wikipedia, a function $f: \mathbb{R}^n \to \mathbb{R} \cup \{-\infty, +\infty\}$ is called coercive if, $$f(x) \to +\infty \text{ as } \|x\| \to +\infty$$ and it is super-coercive if $$\...
Norman's user avatar
  • 125
1 vote
1 answer
228 views

Weak duality sign

Let $\left\{\begin{matrix} \operatorname{min}_xc^Tx\\Ax\leq b \\ x\in \mathbb{R}^+ \end{matrix}\right.$ be a LP primal problem and $\left\{\begin{matrix} \operatorname{max}_yb^Ty\\A^Ty\geq c \\ y\in ...
user853717's user avatar
2 votes
0 answers
43 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 ...
ABIM's user avatar
  • 5,405
5 votes
1 answer
581 views

Strong duality for a particular moment problem

Reading the paper in this Link (see pag 13) with the objective of understanding a topic related to stochastic optimization I came across a problem in demonstrating one of the theorems. The situation ...
matematicaActiva's user avatar
1 vote
0 answers
187 views

Strong Duality of Mixed Integer Linear Program

The problem at hand is to optimize a mixed-integer linear program closely related to the maximum flow problem. I would like to reformulate the problem with its dual and I'm concerned with the ...
Amitai G's user avatar
4 votes
1 answer
934 views

Conjugate function for matrix mixed norm

I am familiar with the conjugate function of the vector norm, which uses the concept of dual norm and is defined as follows: $$\|\mathbf{y}\|_p^*=\max_{\mathbf{x}}\left(\mathbf{x}^T\mathbf{y}-\|\...
Bernard's user avatar
  • 111
8 votes
2 answers
275 views

Is it possible to solve the argument maximization problem $\arg\max_x \langle x,l \rangle −f_1(x)−f_2(x)$ via convex duality?

I am attempting to solve the argument maximization problem $$\arg\sup_x \{ \langle x,l \rangle − f_1(x)−f_2(x) \} \ \ \ \ \ \ \ \ \ \ (1)$$ where the functions $f_1$ and $f_2$ are concave but ...
JNM's user avatar
  • 101