How to minimize $sum_i,j |M[i,j] -(v_1(i) - v_2(j))^2|$
Clash Royale CLAN TAG#URR8PPP
up vote
0
down vote
favorite
Say I have an $n$ by $n$ matrix $M$ of positive real numbers. For two vectors $v_1$ and $v_2$ of length $n$ each, I say that the cost of the vectors is:
$$sum_i,j |M[i,j] -(v_1(i) - v_2(j))^2|$$
How can you choose $v_1$ and $v_2$ to minimize this cost? I can't work out if there is a straightforward formulation of this optimization problem.
optimization
add a comment |Â
up vote
0
down vote
favorite
Say I have an $n$ by $n$ matrix $M$ of positive real numbers. For two vectors $v_1$ and $v_2$ of length $n$ each, I say that the cost of the vectors is:
$$sum_i,j |M[i,j] -(v_1(i) - v_2(j))^2|$$
How can you choose $v_1$ and $v_2$ to minimize this cost? I can't work out if there is a straightforward formulation of this optimization problem.
optimization
add a comment |Â
up vote
0
down vote
favorite
up vote
0
down vote
favorite
Say I have an $n$ by $n$ matrix $M$ of positive real numbers. For two vectors $v_1$ and $v_2$ of length $n$ each, I say that the cost of the vectors is:
$$sum_i,j |M[i,j] -(v_1(i) - v_2(j))^2|$$
How can you choose $v_1$ and $v_2$ to minimize this cost? I can't work out if there is a straightforward formulation of this optimization problem.
optimization
Say I have an $n$ by $n$ matrix $M$ of positive real numbers. For two vectors $v_1$ and $v_2$ of length $n$ each, I say that the cost of the vectors is:
$$sum_i,j |M[i,j] -(v_1(i) - v_2(j))^2|$$
How can you choose $v_1$ and $v_2$ to minimize this cost? I can't work out if there is a straightforward formulation of this optimization problem.
optimization
asked Jul 31 at 16:33
Anush
190224
190224
add a comment |Â
add a comment |Â
active
oldest
votes
active
oldest
votes
active
oldest
votes
active
oldest
votes
active
oldest
votes
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
StackExchange.ready(
function ()
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f2868230%2fhow-to-minimize-sum-i-j-mi-j-v-1i-v-2j2%23new-answer', 'question_page');
);
Post as a guest
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
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
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