Convergence analysis of the Gauss-Newton method for convex inclusion and convex-composite optimization problems (Q663722): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
m rollbackEdits.php mass rollback
Tag: Rollback
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.jmaa.2011.11.062 / rank
Normal rank
 
Property / OpenAlex ID
 
Property / OpenAlex ID: W2064882318 / rank
Normal rank
 

Revision as of 17:22, 19 March 2024

scientific article
Language Label Description Also known as
English
Convergence analysis of the Gauss-Newton method for convex inclusion and convex-composite optimization problems
scientific article

    Statements

    Convergence analysis of the Gauss-Newton method for convex inclusion and convex-composite optimization problems (English)
    0 references
    27 February 2012
    0 references
    \textit{S. M. Robinson} [Numer. Math. 19, 341--347 (1972; Zbl 0227.65040)] proposed the so-called extended Newton method for solving the convex inclusion problem defined by a nonempty closed convex cone \(C\) in a Banach space \(Y\), and a smooth function \(F\) from a reflexive Banach space \(X\) into \(Y\). Under two important assumptions, he established the existence of solution to the convex inclusion problem, and provided the convergence criterion of this method for the convex inclusion problem. In this paper, the authors consider the convergence analysis of the Gauss-Newton method for the convex inclusion problem by using the convex process theory. Under some mild assumptions (which are weaker than Robinson's assumptions), they establish the convergence criterion of the Gauss-Newton method for solving convex-composite optimization problem. Particularly, they also obtain the convergence criterion for the extended Newton method for solving the convex inclusion problem presented by Robinson. Even in the special case when \(X,Y\) are finite-dimensional and \(T_{x_0}\) is surjective, their result is sharper than Robinson's result. Furthermore, the convergence criterions given in this paper are affine-invariant.
    0 references
    Gauss-Newton method
    0 references
    convex process
    0 references
    convex-composite optimization
    0 references
    weak-Robinson condition
    0 references
    majorizing function
    0 references
    convergence criterion
    0 references
    Banach space
    0 references
    convex inclusion problem
    0 references
    0 references
    0 references

    Identifiers