Three-term conjugate gradient method for the convex optimization problem over the fixed point set of a nonexpansive mapping (Q632862): Difference between revisions

From MaRDI portal
ReferenceBot (talk | contribs)
Changed an Item
Normalize DOI.
 
Property / DOI
 
Property / DOI: 10.1016/j.amc.2011.01.005 / rank
Normal rank
 
Property / DOI
 
Property / DOI: 10.1016/J.AMC.2011.01.005 / rank
 
Normal rank

Latest revision as of 06:38, 9 December 2024

scientific article
Language Label Description Also known as
English
Three-term conjugate gradient method for the convex optimization problem over the fixed point set of a nonexpansive mapping
scientific article

    Statements

    Three-term conjugate gradient method for the convex optimization problem over the fixed point set of a nonexpansive mapping (English)
    0 references
    0 references
    28 March 2011
    0 references
    The following optimization problem is considered: \[ \text{Minimize}\quad f(x)\quad\text{subject to }x\in\text{Fix}(T), \] where \(f: H\to\mathbb{R}\) is a continuously Freche differentiable convex function defined on a real Hilbert space \(H\), \(\text{Fix}(T)\) is a nonempty fixed point set of a nonexpansive mapping \(T:H\to H\) and it is assumed that \(\nabla f: H\to H\) is \(\alpha\)-strongly monotone and Lipschitz contunuous. A new gradient method a with a three-term conjugate gradient direction is proposed for solving the problem. Strong convergence to the optimal solution of the problem under standard assumptions is guaranteed. Numerical examples show the effectiveness and fast convergence in comparison with the existing gradient methods.
    0 references
    convex optimization problem
    0 references
    fixed point set
    0 references
    nonexpansive mapping
    0 references
    conjugate gradient
    0 references
    three-term conjugate gradient method
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers