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

Could someone kindly suggest a method of solving the following constrained (equality and inequality) system of equations in the least squares fashion?
$\underset{x}{min}\frac{1}{2}‖Ax-b{‖}_{2}^{2}$
such that

${\tau }_{k}$ is the upper bound for ${x}_{k}$.
You can still ask an expert for help

## Want to know more about Inequalities systems and graphs?

• Questions are typically answered in as fast as 30 minutes

Solve your problem for the price of one coffee

• Math expert for every subject
• Pay only if we can solve it

Elias Flores
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
$\mathrm{\nabla }f\left(x\right)={A}^{T}\left(Ax-b\right)$
and the projected gradient iteration is
${x}^{+}={P}_{S}\left(x-t\mathrm{\nabla }f\left(x\right)\right).$
${x}^{+}={P}_{S}\left(x-t\mathrm{\nabla }f\left(x\right)\right).$
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>0$ is sufficiently small.