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

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

0.00 Avg rating—0 Votes
Article ID: iaor2003739
Country: Germany
Volume: 91
Issue: 2
Start Page Number: 349
End Page Number: 356
Publication Date: Jan 2002
Journal: Mathematical Programming
Authors: ,
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.

Reviews

Required fields are marked *. Your email address will not be published.