Extending the applicability of the Gauss–Newton method for convex composite optimization using restricted convergence domains and average Lipschitz conditions

Simple item page
dc.contributor.authorArgyros, I.K.
dc.contributor.authorGeorge, S.
dc.date.accessioned2026-02-05T09:32:59Z
dc.date.issued2016
dc.description.abstractWe 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. © 2016, Sociedad Española de Matemática Aplicada.
dc.identifier.citationSeMA Journal, 2016, 73, 3, pp. 219-236
dc.identifier.issn22543902
dc.identifier.urihttps://doi.org/10.1007/s40324-016-0066-0
dc.identifier.urihttps://idr.nitk.ac.in/handle/123456789/25921
dc.publisherSpringer Nature
dc.subjectAverage Lipschitz condition
dc.subjectGauss-Newton method
dc.subjectMajorizing sequence
dc.subjectRestricted convergence domain
dc.titleExtending the applicability of the Gauss–Newton method for convex composite optimization using restricted convergence domains and average Lipschitz conditions

Files

Collections

Journal Articles