Iterative Approaches to Convex Minimization Problems

DOI10.1081/NFA-200041707zbMath1156.90427OpenAlexW2108947935MaRDI QIDQ4678765

Hong-Kun Xu, Paranjothi Pillay, John G. O'Hara

Publication date: 23 May 2005

Published in: Numerical Functional Analysis and Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1081/nfa-200041707

zbMATH Keywords

nonexpansive mappingconvex minimizationconvex feasibility problemiterative approach

Mathematics Subject Classification ID

Convex programming (90C25) Nonlinear programming (90C30) Contraction-type mappings, nonexpansive mappings, (A)-proper mappings, etc. (47H09) Numerical solutions to equations with nonlinear operators (65J15)

Cites Work

• Unnamed Item
• Approximation of fixed points of nonexpansive mappings
• Iterative approaches to finding nearest common fixed points of nonexpansive mappings in Hilbert spaces.
• An iterative approach to quadratic optimization
• The approximation of fixed points of compositions of nonexpansive mappings in Hilbert space
• Minimizing certain convex functions over the intersection of the fixed point sets of nonexpansive mappings
• Quadratic optimization of fixed points of nonexpansive mappings in hubert space
• FIXED-POINT THEOREMS FOR NONCOMPACT MAPPINGS IN HILBERT SPACE
• Fixed points of nonexpanding maps

This page was built for publication: Iterative Approaches to Convex Minimization Problems