Three-term conjugate gradient method for the convex optimization problem over the fixed point set of a nonexpansive mapping
From MaRDI portal
Publication:632862
DOI10.1016/J.AMC.2011.01.005zbMATH Open1213.65088OpenAlexW2074209542MaRDI QIDQ632862FDOQ632862
Authors: Hideaki Iiduka 
Publication date: 28 March 2011
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2011.01.005
Recommendations
- Hybrid conjugate gradient method for a convex optimization problem over the fixed-point set of a nonexpansive mapping
- The Adaptive Projected Subgradient Method over the Fixed Point Set of Strongly Attracting Nonexpansive Mappings
- A Use of Conjugate Gradient Direction for the Convex Optimization Problem over the Fixed Point Set of a Nonexpansive Mapping
- Acceleration method for convex optimization over the fixed point set of a nonexpansive mapping
- scientific article; zbMATH DE number 7014239
conjugate gradientthree-term conjugate gradient methodnonexpansive mappingfixed point setconvex optimization problem
Cites Work
- Regularization tools version \(4.0\) for matlab \(7.3\)
- Numerical Optimization
- On Projection Algorithms for Solving Convex Feasibility Problems
- Function minimization by conjugate gradients
- A descent modified Polak–Ribière–Polyak conjugate gradient method and its global convergence
- A Nonlinear Conjugate Gradient Method with a Strong Global Convergence Property
- Some descent three-term conjugate gradient methods and their global convergence
- A Two-Term PRP-Based Descent Method
- The conjugate gradient method in extremal problems
- Methods of conjugate gradients for solving linear systems
- Nonlinear functional analysis. Fixed point theory and its applications
- The hybrid steepest descent method for the variational inequality problem over the intersection of fixed point sets of nonexpansive mappings
- Title not available (Why is that?)
- Descent Property and Global Convergence of the Fletcher—Reeves Method with Inexact Line Search
- Title not available (Why is that?)
- Title not available (Why is that?)
- Global Convergence Properties of Conjugate Gradient Methods for Optimization
- Title not available (Why is that?)
- Convex programming in Hilbert space
- Title not available (Why is that?)
- Title not available (Why is that?)
- A Use of Conjugate Gradient Direction for the Convex Optimization Problem over the Fixed Point Set of a Nonexpansive Mapping
- Best approximation in inner product spaces
- Iterative selection methods for common fixed point problems
- Some problems and results in fixed point theory
- Title not available (Why is that?)
- Convex analysis and nonlinear optimization. Theory and examples
- Global convergence of a modified Fletcher-Reeves conjugate gradient method with Armijo-type line search
- Finding the nearest point in A polytope
- Fixed point optimization algorithm and its application to power control in CDMA data networks
- Robust Wideband Beamforming by the Hybrid Steepest Descent Method
- Convergence properties of the Fletcher-Reeves method
- A block-iterative surrogate constraint splitting method for quadratic signal recovery
- Computational method for solving a stochastic linear-quadratic control problem given an unsolvable stochastic algebraic Riccati equation
- Title not available (Why is that?)
Cited In (15)
- Optimization for Inconsistent Split Feasibility Problems
- Title not available (Why is that?)
- A dynamic distributed conjugate gradient method for variational inequality problem over the common fixed-point constraints
- Hybrid conjugate gradient method for a convex optimization problem over the fixed-point set of a nonexpansive mapping
- A new accelerated algorithm for solving variational inequalities over the solution of multiple set split common fixed point problem
- An extended projected residual algorithm for solving smooth convex optimization problems
- Fejér-monotone hybrid steepest descent method for affinely constrained and composite convex minimization
- Line search fixed point algorithms based on nonlinear conjugate gradient directions: application to constrained smooth convex optimization
- On perturbed hybrid steepest descent method with minimization or superiorization for subdifferentiable functions
- Applying conditional subgradient-like directions to the modified Krasnosel'skiĭ-Mann fixed point algorithm based on the three-term conjugate gradient method
- Acceleration method for convex optimization over the fixed point set of a nonexpansive mapping
- A Use of Conjugate Gradient Direction for the Convex Optimization Problem over the Fixed Point Set of a Nonexpansive Mapping
- Extrapolated sequential constraint method for variational inequality over the intersection of fixed-point sets
- On an ergodic method for a convex optimization problem over the fixed point set
- Perturbation resilience and superiorization methodology of averaged mappings
Uses Software
This page was built for publication: Three-term conjugate gradient method for the convex optimization problem over the fixed point set of a nonexpansive mapping
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q632862)
