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.005zbMath1213.65088OpenAlexW2074209542MaRDI QIDQ632862
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
nonexpansive mappingfixed point setconvex optimization problemthree-term conjugate gradient methodconjugate gradient
Related Items
An extended projected residual algorithm for solving smooth convex optimization problems ⋮ Perturbation resilience and superiorization methodology of averaged mappings ⋮ On perturbed hybrid steepest descent method with minimization or superiorization for subdifferentiable functions ⋮ A dynamic distributed conjugate gradient method for variational inequality problem over the common fixed-point constraints ⋮ Extrapolated sequential constraint method for variational inequality over the intersection of fixed-point sets ⋮ Fejér-monotone hybrid steepest descent method for affinely constrained and composite convex minimization tasks ⋮ Acceleration method for convex optimization over the fixed point set of a nonexpansive mapping ⋮ Optimization for Inconsistent Split Feasibility Problems
Uses Software
Cites Work
- Fixed point optimization algorithm and its application to power control in CDMA data networks
- Iterative selection methods for common fixed point problems
- Convex analysis and nonlinear optimization. Theory and examples
- Global convergence of a modified Fletcher-Reeves conjugate gradient method with Armijo-type line search
- Regularization tools version \(4.0\) for matlab \(7.3\)
- Computational Method for Solving a Stochastic Linear-Quadratic Control Problem Given an Unsolvable Stochastic Algebraic Riccati Equation
- Some problems and results in fixed point theory
- A descent modified Polak–Ribière–Polyak conjugate gradient method and its global convergence
- A Use of Conjugate Gradient Direction for the Convex Optimization Problem over the Fixed Point Set of a Nonexpansive Mapping
- Descent Property and Global Convergence of the Fletcher—Reeves Method with Inexact Line Search
- Global Convergence Properties of Conjugate Gradient Methods for Optimization
- Finding the nearest point in A polytope
- Numerical Optimization
- Robust Wideband Beamforming by the Hybrid Steepest Descent Method
- On Projection Algorithms for Solving Convex Feasibility Problems
- Convergence properties of the Fletcher-Reeves method
- A Nonlinear Conjugate Gradient Method with a Strong Global Convergence Property
- Function minimization by conjugate gradients
- A block-iterative surrogate constraint splitting method for quadratic signal recovery
- Some descent three-term conjugate gradient methods and their global convergence
- A Two-Term PRP-Based Descent Method
- Convex programming in Hilbert space
- The conjugate gradient method in extremal problems
- Methods of conjugate gradients for solving linear systems
- Best approximation in inner product spaces
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
