Abstract
We present a new technique to study the semilocal convergence analysis of the Gauss–Newton method (GNA) to solve convex composite optimization problems under average-type Lipschitz conditions. The novelty of this technique lies in the fact that tighter majorizing sequences than in earlier studies can be obtained. This is achieved by restricting the domain where the iterates of GNA lie. Special cases and numerical examples are also provided in this study.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
