Skip to main content
SpringerLink
Log in

On convergence of the Gauss-Newton method for convex composite optimization

  • Published:
Mathematical Programming Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Author information

Authors and Affiliations

  1. Department of Applied Mathematics, Southeast University, Nanjing 210096, P.R. China, e-mail: cli@seu.edu.cn, , , , , , CN

    Chong Li

  2. Department of Mathematics, Zhejiang University, Hangzhou 310028, P.R. China, , , , , , CN

    Xinghua Wang

Authors
  1. Chong Li
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Xinghua Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Received: July 24, 1998 / Accepted: November 29, 2000¶Published online September 3, 2001

Rights and permissions

Reprints 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

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/s101070100249

Search

Navigation