The Proximity Operator of a Function with Multiple Affine MappingProximal mapping for composition of...
How to travel to Japan while expressing milk?
Can I hook these wires up to find the connection to a dead outlet?
Why is it a bad idea to hire a hitman to eliminate most corrupt politicians?
Do Iron Man suits sport waste management systems?
Is there a hemisphere-neutral way of specifying a season?
How many wives did king shaul have
What do you call someone who asks many questions?
How dangerous is XSS
What is required to make GPS signals available indoors?
What is a Samsaran Word™?
Does int main() need a declaration on C++?
how do we prove that a sum of two periods is still a period?
Finding the error in an argument
Notepad++ delete until colon for every line with replace all
Am I breaking OOP practice with this architecture?
One verb to replace 'be a member of' a club
In Bayesian inference, why are some terms dropped from the posterior predictive?
Can a virus destroy the BIOS of a modern computer?
Is it a bad idea to plug the other end of ESD strap to wall ground?
Why were 5.25" floppy drives cheaper than 8"?
Different meanings of こわい
Ambiguity in the definition of entropy
Forgetting the musical notes while performing in concert
ssTTsSTtRrriinInnnnNNNIiinngg
The Proximity Operator of a Function with Multiple Affine Mapping
Proximal mapping for composition of functionsProximal functionsProximal mapping of $f(U) = -log det(U)$Proof of convergence for the proximal point algorithmWhen is a mapping the proximity operator of some convex function?Does the linear transformation that a matrix encodes depend on a choice of basis?How to derive the proximal operator of the Euclidian norm?How to Do Backtracking Line Search for Proximal Gradient Decent?Low-rank matrix satisfying linear constraints linear mappingProximal Mappings intuition and practical example
$begingroup$
Let $f(mathbf{x}) = g(mathbf{A}mathbf{x})$, where $mathbf{A} in mathbb{R}^{M times N}$ is a linear transformation satisfying $mathbf{A}mathbf{A}^T = mathbf{I}$. Then for any $mathbf{x} in mathbb{R}^{N}$,
begin{equation}
text{prox}_f (mathbf{x}) = mathbf{x} + mathbf{A}^T (text{prox}_g(mathbf{Ax}) − mathbf{Ax}).
end{equation}
Now, if $f(mathbf{x}) = sum_{p=1}^{P} g(mathbf{A}_pmathbf{x})$, where $mathbf{A}_p in mathbb{R}^{M times N}$ are multiple linear trasformations satisfying $mathbf{A}_pmathbf{A}_p^T = mathbf{I}$. Then for any $mathbf{x} in mathbb{R}^{N}$, what would be the proximal mapping for the new $f(mathbf{x})$?.
linear-algebra optimization convex-analysis
$endgroup$
add a comment |
$begingroup$
Let $f(mathbf{x}) = g(mathbf{A}mathbf{x})$, where $mathbf{A} in mathbb{R}^{M times N}$ is a linear transformation satisfying $mathbf{A}mathbf{A}^T = mathbf{I}$. Then for any $mathbf{x} in mathbb{R}^{N}$,
begin{equation}
text{prox}_f (mathbf{x}) = mathbf{x} + mathbf{A}^T (text{prox}_g(mathbf{Ax}) − mathbf{Ax}).
end{equation}
Now, if $f(mathbf{x}) = sum_{p=1}^{P} g(mathbf{A}_pmathbf{x})$, where $mathbf{A}_p in mathbb{R}^{M times N}$ are multiple linear trasformations satisfying $mathbf{A}_pmathbf{A}_p^T = mathbf{I}$. Then for any $mathbf{x} in mathbb{R}^{N}$, what would be the proximal mapping for the new $f(mathbf{x})$?.
linear-algebra optimization convex-analysis
$endgroup$
add a comment |
$begingroup$
Let $f(mathbf{x}) = g(mathbf{A}mathbf{x})$, where $mathbf{A} in mathbb{R}^{M times N}$ is a linear transformation satisfying $mathbf{A}mathbf{A}^T = mathbf{I}$. Then for any $mathbf{x} in mathbb{R}^{N}$,
begin{equation}
text{prox}_f (mathbf{x}) = mathbf{x} + mathbf{A}^T (text{prox}_g(mathbf{Ax}) − mathbf{Ax}).
end{equation}
Now, if $f(mathbf{x}) = sum_{p=1}^{P} g(mathbf{A}_pmathbf{x})$, where $mathbf{A}_p in mathbb{R}^{M times N}$ are multiple linear trasformations satisfying $mathbf{A}_pmathbf{A}_p^T = mathbf{I}$. Then for any $mathbf{x} in mathbb{R}^{N}$, what would be the proximal mapping for the new $f(mathbf{x})$?.
linear-algebra optimization convex-analysis
$endgroup$
Let $f(mathbf{x}) = g(mathbf{A}mathbf{x})$, where $mathbf{A} in mathbb{R}^{M times N}$ is a linear transformation satisfying $mathbf{A}mathbf{A}^T = mathbf{I}$. Then for any $mathbf{x} in mathbb{R}^{N}$,
begin{equation}
text{prox}_f (mathbf{x}) = mathbf{x} + mathbf{A}^T (text{prox}_g(mathbf{Ax}) − mathbf{Ax}).
end{equation}
Now, if $f(mathbf{x}) = sum_{p=1}^{P} g(mathbf{A}_pmathbf{x})$, where $mathbf{A}_p in mathbb{R}^{M times N}$ are multiple linear trasformations satisfying $mathbf{A}_pmathbf{A}_p^T = mathbf{I}$. Then for any $mathbf{x} in mathbb{R}^{N}$, what would be the proximal mapping for the new $f(mathbf{x})$?.
linear-algebra optimization convex-analysis
linear-algebra optimization convex-analysis
asked Mar 18 at 14:07
Héctor Miguel Vargas GarcíaHéctor Miguel Vargas García
112
112
add a comment |
add a comment |
1 Answer
1
active
oldest
votes
$begingroup$
Even in the simpler case where $P=2$ and $A_1=A_2= textbf{I}$, there does not exist a closed form solution for the proximal operator of the sum. If you are interested in solving an optimization problem check the keywords "Douglas-Rachford" and "splitting".
$endgroup$
add a comment |
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%2f3152831%2fthe-proximity-operator-of-a-function-with-multiple-affine-mapping%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
1 Answer
1
active
oldest
votes
1 Answer
1
active
oldest
votes
active
oldest
votes
active
oldest
votes
$begingroup$
Even in the simpler case where $P=2$ and $A_1=A_2= textbf{I}$, there does not exist a closed form solution for the proximal operator of the sum. If you are interested in solving an optimization problem check the keywords "Douglas-Rachford" and "splitting".
$endgroup$
add a comment |
$begingroup$
Even in the simpler case where $P=2$ and $A_1=A_2= textbf{I}$, there does not exist a closed form solution for the proximal operator of the sum. If you are interested in solving an optimization problem check the keywords "Douglas-Rachford" and "splitting".
$endgroup$
add a comment |
$begingroup$
Even in the simpler case where $P=2$ and $A_1=A_2= textbf{I}$, there does not exist a closed form solution for the proximal operator of the sum. If you are interested in solving an optimization problem check the keywords "Douglas-Rachford" and "splitting".
$endgroup$
Even in the simpler case where $P=2$ and $A_1=A_2= textbf{I}$, there does not exist a closed form solution for the proximal operator of the sum. If you are interested in solving an optimization problem check the keywords "Douglas-Rachford" and "splitting".
answered 2 days ago
xelxel
1338
1338
add a comment |
add a comment |
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%2f3152831%2fthe-proximity-operator-of-a-function-with-multiple-affine-mapping%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