Could someone kindly suggest a method of solving the following constrained (equality and inequality) system of equations in the least squares fashion? min x 1 2 ‖ A x − b ‖ 2 2 such that x i + x j = 1 for a certain i , j 0 &lt; x k &lt; τ k where k ≠ i , j τ k is the upper bound for x k .

Question

Could someone kindly suggest a method of solving the following constrained (equality and inequality) system of equations in the least squares fashion?      min    x        1    2    ‖  A  x  −  b      ‖    2    2  such that                              x          i                +                  x          j                =        1                for a certain         i        ,        j                            0        &amp;lt;                  x          k                &amp;lt;                  τ          k                        where         k        ≠        i        ,        j                  τ    k   is the upper bound for       x    k  .

Elias Flores · Accepted Answer

You can solve this problem using the projected gradient method (or an accelerated projected gradient method). Let   S be the set of all   x that satisfy the given constraints. The gradient of the objective function   f is  ∇  f  (  x  )  =      A    T    (  A  x  −  b  )and the projected gradient iteration is      x    +    =      P    S    (  x  −  t  ∇  f  (  x  )  )  .      x    +    =      P    S    (  x  −  t  ∇  f  (  x  )  )  .The function       P    S   projects onto   S. This projection step requires solving a linear algebra subproblem. (Note that the second set of constraints can be handled independently of the first set of constraints. If the linear constraints are described more explicitly, we can give more detail.) The projected gradient iteration will converge if the step size   t  &amp;gt;  0 is sufficiently small.

Could someone kindly suggest a method of solving the following constrained (equality and inequality)

Answered question

Answer & Explanation

New Questions in Algebra I