In this chapter we extend the solvability of convex composite optimization problems using Gauss–Newton method. We present the algorithm and study the regularity. Then we present the semilocal convergence study and finish with numerical examples validating the theoretical results.