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
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Descent Property and Global Convergence of the Fletcher—Reeves Method with Inexact Line Search / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Projection Algorithms for Solving Convex Feasibility Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex analysis and nonlinear optimization. Theory and examples / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Two-Term PRP-Based Descent Method / rank
 
Normal rank
Property / cites work
 
Property / cites work: A block-iterative surrogate constraint splitting method for quadratic signal recovery / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convergence properties of the Fletcher-Reeves method / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Nonlinear Conjugate Gradient Method with a Strong Global Convergence Property / rank
 
Normal rank
Property / cites work
 
Property / cites work: Best approximation in inner product spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4702909 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Function minimization by conjugate gradients / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global Convergence Properties of Conjugate Gradient Methods for Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3998720 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3322631 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex programming in Hilbert space / rank
 
Normal rank
Property / cites work
 
Property / cites work: Regularization tools version \(4.0\) for matlab \(7.3\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Methods of conjugate gradients for solving linear systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3141900 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Iterative selection methods for common fixed point problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fixed point optimization algorithm and its application to power control in CDMA data networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Use of Conjugate Gradient Direction for the Convex Optimization Problem over the Fixed Point Set of a Nonexpansive Mapping / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational Method for Solving a Stochastic Linear-Quadratic Control Problem Given an Unsolvable Stochastic Algebraic Riccati Equation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Numerical Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5563083 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The conjugate gradient method in extremal problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some problems and results in fixed point theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust Wideband Beamforming by the Hybrid Steepest Descent Method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4384476 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2762769 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding the nearest point in A polytope / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2768033 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4409551 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A descent modified Polak–Ribière–Polyak conjugate gradient method and its global convergence / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global convergence of a modified Fletcher-Reeves conjugate gradient method with Armijo-type line search / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some descent three-term conjugate gradient methods and their global convergence / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3706043 / rank
 
Normal rank

Latest revision as of 22:33, 3 July 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
    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
    0 references