Quadratic optimization of fixed points of nonexpansive mappings in hubert space
Publication:4386129
DOI10.1080/01630569808816822zbMath0911.47051OpenAlexW2014913012MaRDI QIDQ4386129
Isao Yamada, Kohichi Sakaniwa, Yukihiko Yamashita, Nobuhiko Ogura
Publication date: 4 May 1999
Published in: Numerical Functional Analysis and Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/01630569808816822
Numerical mathematical programming methods (65K05) Convex programming (90C25) Nonlinear programming (90C30) Numerical optimization and variational techniques (65K10) Fixed-point theorems (47H10) Contraction-type mappings, nonexpansive mappings, (A)-proper mappings, etc. (47H09)
Related Items (40)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the convergence of Han's method for convex programming with quadratic objective
- Approximation of fixed points of nonexpansive mappings
- A successive projection method
- Dykstra's alternating projection algorithm for two sets
- The rate of convergence for the method of alternating projections. II
- Two generalizations of Dykstra's cyclic projections algorithm
- Proximity Maps for Convex Sets
- An Algorithm for Restricted Least Squares Regression
- Decomposition through formalization in a product space
- The rate of convergence of dykstra's cyclic projections algorithm: The polyhedral case
- On Projection Algorithms for Solving Convex Feasibility Problems
- Finding projections onto the intersection of convex sets in hilbert spaces
- FIXED-POINT THEOREMS FOR NONCOMPACT MAPPINGS IN HILBERT SPACE
- Fixed points of nonexpanding maps
- Weak convergence of the sequence of successive approximations for nonexpansive mappings
This page was built for publication: Quadratic optimization of fixed points of nonexpansive mappings in hubert space