Optimization in Banach space: Find functions that minimize the supremum of a convex operator.
$begingroup$
Let $D subset mathbb{R}^n$ be compact. Denote by $C(D, mathbb{R}^n)$ the space of continuous functions from $D$ to $mathbb{R}^n$.
Let $K$ be a real, symmetric, positive-definite $n times n$ matrix and let $k in C(D, mathbb{R}^n)$.
We consider the following convex "functional":
$$mathcal{F}:C(D, mathbb{R}^n) rightarrow C(D
)$$
$$mathcal{F}[b](x) := b(x)^T K b(x) - 2 k(x)^T b(x)$$
where $^T$ denotes transpose.
We are interested in the quantity
$$M_b := sup_{x in D} mathcal{F}[b](x)$$
We are looking for the function $b in C(D, mathbb{R}^n)$ that minimizes this quantity, under the constraint that $b(x)$ lies on the probability simplex $Delta$ for all $x$.
$$inf_{substack{b in C(D, mathbb{R}^n)} \ b in Delta} ~ ~ Big(sup_{x in D} mathcal{F}[b](x)Big)$$
Formally, the constraint $b in Delta$ is:
$$forall x in D: sum_{i = 1}^n b_i(x) = 1 text{ and } b_i(x) geq 0 text{ for i=1, ...,n} $$
Where, for $b in C(D, mathbb{R}^n)$, we write: $b(x) = begin{pmatrix}
d_1(x)\
vdots\
d_n(x)
end{pmatrix}$
I am looking for any reference that could help me solve this problem.
More precisely, references to any article / book related to the subject would already help. I don't even know that the name of this field of mathematics is.
Remarks:
- I am interested in numerical or analytical solutions to the above problem.
- An approximate solution would also be OK.
- I know the solution to the unconstrained version of the problem.
- The current setting is to look for solutions in the class of continuous functions, but that setting can be relaxed: in the end, piecewise continous is enough.
optimization banach-spaces calculus-of-variations variational-analysis
asked Nov 29 '18 at 10:30
Cédric TravellettiCédric Travelletti
1095
$endgroup$
add a comment |
$begingroup$
Let $D subset mathbb{R}^n$ be compact. Denote by $C(D, mathbb{R}^n)$ the space of continuous functions from $D$ to $mathbb{R}^n$.
Let $K$ be a real, symmetric, positive-definite $n times n$ matrix and let $k in C(D, mathbb{R}^n)$.
We consider the following convex "functional":
$$mathcal{F}:C(D, mathbb{R}^n) rightarrow C(D
)$$
$$mathcal{F}[b](x) := b(x)^T K b(x) - 2 k(x)^T b(x)$$
where $^T$ denotes transpose.
We are interested in the quantity
$$M_b := sup_{x in D} mathcal{F}[b](x)$$
We are looking for the function $b in C(D, mathbb{R}^n)$ that minimizes this quantity, under the constraint that $b(x)$ lies on the probability simplex $Delta$ for all $x$.
$$inf_{substack{b in C(D, mathbb{R}^n)} \ b in Delta} ~ ~ Big(sup_{x in D} mathcal{F}[b](x)Big)$$
Formally, the constraint $b in Delta$ is:
$$forall x in D: sum_{i = 1}^n b_i(x) = 1 text{ and } b_i(x) geq 0 text{ for i=1, ...,n} $$
Where, for $b in C(D, mathbb{R}^n)$, we write: $b(x) = begin{pmatrix}
d_1(x)\
vdots\
d_n(x)
end{pmatrix}$
I am looking for any reference that could help me solve this problem.
More precisely, references to any article / book related to the subject would already help. I don't even know that the name of this field of mathematics is.
Remarks:
- I am interested in numerical or analytical solutions to the above problem.
- An approximate solution would also be OK.
- I know the solution to the unconstrained version of the problem.
- The current setting is to look for solutions in the class of continuous functions, but that setting can be relaxed: in the end, piecewise continous is enough.
optimization banach-spaces calculus-of-variations variational-analysis
asked Nov 29 '18 at 10:30
Cédric TravellettiCédric Travelletti
1095
$endgroup$
add a comment |
$begingroup$
Let $D subset mathbb{R}^n$ be compact. Denote by $C(D, mathbb{R}^n)$ the space of continuous functions from $D$ to $mathbb{R}^n$.
Let $K$ be a real, symmetric, positive-definite $n times n$ matrix and let $k in C(D, mathbb{R}^n)$.
We consider the following convex "functional":
$$mathcal{F}:C(D, mathbb{R}^n) rightarrow C(D
)$$
$$mathcal{F}[b](x) := b(x)^T K b(x) - 2 k(x)^T b(x)$$
where $^T$ denotes transpose.
We are interested in the quantity
$$M_b := sup_{x in D} mathcal{F}[b](x)$$
We are looking for the function $b in C(D, mathbb{R}^n)$ that minimizes this quantity, under the constraint that $b(x)$ lies on the probability simplex $Delta$ for all $x$.
$$inf_{substack{b in C(D, mathbb{R}^n)} \ b in Delta} ~ ~ Big(sup_{x in D} mathcal{F}[b](x)Big)$$
Formally, the constraint $b in Delta$ is:
$$forall x in D: sum_{i = 1}^n b_i(x) = 1 text{ and } b_i(x) geq 0 text{ for i=1, ...,n} $$
Where, for $b in C(D, mathbb{R}^n)$, we write: $b(x) = begin{pmatrix}
d_1(x)\
vdots\
d_n(x)
end{pmatrix}$
I am looking for any reference that could help me solve this problem.
More precisely, references to any article / book related to the subject would already help. I don't even know that the name of this field of mathematics is.
Remarks:
- I am interested in numerical or analytical solutions to the above problem.
- An approximate solution would also be OK.
- I know the solution to the unconstrained version of the problem.
- The current setting is to look for solutions in the class of continuous functions, but that setting can be relaxed: in the end, piecewise continous is enough.
optimization banach-spaces calculus-of-variations variational-analysis
asked Nov 29 '18 at 10:30
Cédric TravellettiCédric Travelletti
1095
$endgroup$
Let $D subset mathbb{R}^n$ be compact. Denote by $C(D, mathbb{R}^n)$ the space of continuous functions from $D$ to $mathbb{R}^n$.
Let $K$ be a real, symmetric, positive-definite $n times n$ matrix and let $k in C(D, mathbb{R}^n)$.
We consider the following convex "functional":
$$mathcal{F}:C(D, mathbb{R}^n) rightarrow C(D
)$$
$$mathcal{F}[b](x) := b(x)^T K b(x) - 2 k(x)^T b(x)$$
where $^T$ denotes transpose.
We are interested in the quantity
$$M_b := sup_{x in D} mathcal{F}[b](x)$$
We are looking for the function $b in C(D, mathbb{R}^n)$ that minimizes this quantity, under the constraint that $b(x)$ lies on the probability simplex $Delta$ for all $x$.
$$inf_{substack{b in C(D, mathbb{R}^n)} \ b in Delta} ~ ~ Big(sup_{x in D} mathcal{F}[b](x)Big)$$
Formally, the constraint $b in Delta$ is:
$$forall x in D: sum_{i = 1}^n b_i(x) = 1 text{ and } b_i(x) geq 0 text{ for i=1, ...,n} $$
Where, for $b in C(D, mathbb{R}^n)$, we write: $b(x) = begin{pmatrix}
d_1(x)\
vdots\
d_n(x)
end{pmatrix}$
I am looking for any reference that could help me solve this problem.
More precisely, references to any article / book related to the subject would already help. I don't even know that the name of this field of mathematics is.
Remarks:
- I am interested in numerical or analytical solutions to the above problem.
- An approximate solution would also be OK.
- I know the solution to the unconstrained version of the problem.
- The current setting is to look for solutions in the class of continuous functions, but that setting can be relaxed: in the end, piecewise continous is enough.
optimization banach-spaces calculus-of-variations variational-analysis
optimization banach-spaces calculus-of-variations variational-analysis
asked Nov 29 '18 at 10:30
Cédric TravellettiCédric Travelletti
1095
asked Nov 29 '18 at 10:30
Cédric TravellettiCédric Travelletti
1095
asked Nov 29 '18 at 10:30
Cédric TravellettiCédric Travelletti
1095
asked Nov 29 '18 at 10:30
Cédric TravellettiCédric Travelletti
1095
asked Nov 29 '18 at 10:30
Cédric TravellettiCédric Travelletti
1095
1095
add a comment |
add a comment |
0
active
oldest
votes
Your Answer
StackExchange.ifUsing("editor", function () {
return StackExchange.using("mathjaxEditing", function () {
StackExchange.MarkdownEditor.creationCallbacks.add(function (editor, postfix) {
StackExchange.mathjaxEditing.prepareWmdForMathJax(editor, postfix, [["$", "$"], ["\\(","\\)"]]);
});
});
}, "mathjax-editing");
StackExchange.ready(function() {
var channelOptions = {
tags: "".split(" "),
id: "69"
};
initTagRenderer("".split(" "), "".split(" "), channelOptions);
StackExchange.using("externalEditor", function() {
// Have to fire editor after snippets, if snippets enabled
if (StackExchange.settings.snippets.snippetsEnabled) {
StackExchange.using("snippets", function() {
createEditor();
});
}
else {
createEditor();
}
});
function createEditor() {
StackExchange.prepareEditor({
heartbeatType: 'answer',
autoActivateHeartbeat: false,
convertImagesToLinks: true,
noModals: true,
showLowRepImageUploadWarning: true,
reputationToPostImages: 10,
bindNavPrevention: true,
postfix: "",
imageUploader: {
brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
allowUrls: true
},
noCode: true, onDemand: true,
discardSelector: ".discard-answer"
,immediatelyShowMarkdownHelp:true
});
}
});
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3018449%2foptimization-in-banach-space-find-functions-that-minimize-the-supremum-of-a-con%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
0
active
oldest
votes
0
active
oldest
votes
active
oldest
votes
active
oldest
votes
Thanks for contributing an answer to Mathematics Stack Exchange!
- Please be sure to answer the question. Provide details and share your research!
But avoid …
- Asking for help, clarification, or responding to other answers.
- Making statements based on opinion; back them up with references or personal experience.
Use MathJax to format equations. MathJax reference.
To learn more, see our tips on writing great answers.
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3018449%2foptimization-in-banach-space-find-functions-that-minimize-the-supremum-of-a-con%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
