A Use of Conjugate Gradient Direction for the Convex Optimization Problem over the Fixed Point Set of a Nonexpansive Mapping
DOI10.1137/070702497zbMath1176.47064MaRDI QIDQ3648534
Publication date: 27 November 2009
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/070702497
fixed point; nonexpansive mapping; convex optimization problem; hybrid steepest descent method; conjugate gradient direction
90C25: Convex programming
90C30: Nonlinear programming
47J20: Variational and other types of inequalities involving nonlinear operators (general)
65K10: Numerical optimization and variational techniques
47H09: Contraction-type mappings, nonexpansive mappings, (A)-proper mappings, etc.
90C52: Methods of reduced gradient type
47N40: Applications of operator theory in numerical analysis
Related Items
Uses Software