Question: We consider a problem with linear equality constraints where A R m,n, with A full row rank: rank A = m n, and
We consider a problem with linear equality constraints
![]()
where A ∈ Rm,n, with A full row rank: rank A = m ≤ n, and where we assume that the objective function f0 is decomposable, that is

with each hi a convex, twice differentiable function. This problem can be addressed via different approaches.

min fo(x): Ax = b, X
Step by Step Solution
3.39 Rating (168 Votes )
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
