We consider a problem with linear equality constraints where A R m,n, with A full row
Question:
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.
Fantastic news! We've Found the answer you've been seeking!
Step by Step Answer:
Related Book For
Optimization Models
ISBN: 9781107050877
1st Edition
Authors: Giuseppe C. Calafiore, Laurent El Ghaoui
Question Posted: