ABSTRACT

This chapter is concerned with the convex composite optimizations problem. It presents a convergence analysis of Gauss-Newton method defined by Gauss-Newton Algorithm (GNA). The chapter re-introduces the notion of quasi-regularity and provides the semilocal convergence analysis of GNA. Numerical examples and applications of theoretical results of Gauss-Newton method are also included.