Hybrid conjugate gradient method for a convex optimization problem over the fixed-point set of a nonexpansive mapping
From MaRDI portal
Publication:1016416
DOI10.1007/s10957-008-9463-6zbMath1176.90459OpenAlexW2065624389MaRDI QIDQ1016416
Publication date: 5 May 2009
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10957-008-9463-6
Convex programming (90C25) Contraction-type mappings, nonexpansive mappings, (A)-proper mappings, etc. (47H09) Methods of reduced gradient type (90C52)
Related Items (4)
Strong convergence for an iterative method for the triple-hierarchical constrained optimization problem ⋮ Fixed point optimization algorithm and its application to power control in CDMA data networks ⋮ A new generalized shrinkage conjugate gradient method for sparse recovery ⋮ Conjugate gradient methods using value of objective function for unconstrained optimization
Cites Work
- Iterative selection methods for common fixed point problems
- Computation of symmetric positive definite Toeplitz matrices by the hybrid steepest descent method
- Approximation of fixed points of nonexpansive mappings
- Variational inequalities, complementarity problems, and duality theorems
- Convex analysis and nonlinear optimization. Theory and examples
- The approximation of fixed points of compositions of nonexpansive mappings in Hilbert space
- Exact penalization and stationarity conditions of mathematical programs with equilibrium constraints
- Some problems and results in fixed point theory
- A subgradient-type method for the equilibrium problem over the fixed point set and its applications
- 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
- A New Projection Method for Variational Inequality Problems
- Numerical Optimization
- Robust Wideband Beamforming by the Hybrid Steepest Descent Method
- Hybrid Steepest Descent Method for Variational Inequality Problem over the Fixed Point Set of Certain Quasi-nonexpansive Mappings
- On Projection Algorithms for Solving Convex Feasibility Problems
- Finite-Dimensional Variational Inequalities and Complementarity Problems
- Finite-Dimensional Variational Inequalities and Complementarity 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
- Convex programming in Hilbert space
- Fixed points of nonexpanding maps
- Convergence Conditions for Ascent Methods
- Convergence Conditions for Ascent Methods. II: Some Corrections
- 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
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Hybrid conjugate gradient method for a convex optimization problem over the fixed-point set of a nonexpansive mapping
