ITERATIVE COMPUTATION FOR SOLVING CONVEX OPTIMIZATION PROBLEMS OVER THE SET OF COMMON FIXED POINTS OF QUASI-NONEXPANSIVE AND DEMICONTRACTIVE MAPPINGS
From MaRDI portal
Publication:5064423
DOI10.22190/FUMI190815035SzbMath1497.47114MaRDI QIDQ5064423
No author found.
Publication date: 16 March 2022
Published in: Facta Universitatis, Series: Mathematics and Informatics (Search for Journal in Brave)
Numerical optimization and variational techniques (65K10) Contraction-type mappings, nonexpansive mappings, (A)-proper mappings, etc. (47H09) Fixed-point iterations (47J26)
Cites Work
- Fixed point optimization algorithm and its application to power control in CDMA data networks
- Weak and strong convergence theorems for strict pseudo-contractions in Hilbert spaces
- Fixed point optimization algorithm and its application to network bandwidth allocation
- Convergence theorems for sequences of nonlinear operators in Banach spaces
- A Use of Conjugate Gradient Direction for the Convex Optimization Problem over the Fixed Point Set of a Nonexpansive Mapping
- A block-iterative surrogate constraint splitting method for quadratic signal recovery
- Fixed points of nonexpanding maps
This page was built for publication: ITERATIVE COMPUTATION FOR SOLVING CONVEX OPTIMIZATION PROBLEMS OVER THE SET OF COMMON FIXED POINTS OF QUASI-NONEXPANSIVE AND DEMICONTRACTIVE MAPPINGS
