Abstract.
The local quadratic convergence of the Gauss-Newton method for convex composite optimization f=h∘F is established for any convex function h with the minima set C, extending Burke and Ferris’ results in the case when C is a set of weak sharp minima for h.
Article PDF
Similar content being viewed by others
Avoid common mistakes on your manuscript.
Author information
Authors and Affiliations
Additional information
Received: July 24, 1998 / Accepted: November 29, 2000¶Published online September 3, 2001
Rights and permissions
About this article
Cite this article
Li, C., Wang, X. On convergence of the Gauss-Newton method for convex composite optimization. Math. Program. 91, 349–356 (2002). https://doi.org/10.1007/s101070100249
Issue Date:
DOI: https://doi.org/10.1007/s101070100249