Iterative Approaches to Convex Minimization Problems
From MaRDI portal
(Redirected from Iterative Approaches to Convex Minimization Problems)
The purpose of this paper is to prove convergence theorems for the iterative sequences generated by nonexpansive mappings \(T_n\) in Hilbert spaces. Recently, \textit{I. Yamada, N. Ogura, Y. Yamashita} and \textit{K.~Sakaniwa} [Numer. Funct. Anal. Optim. 19, No. 1--2, 165--190 (1998; Zbl 0911.47051)] proposed algorithms for minimizing quadratic function \(\theta\) over the common fixed point set \(F\) of mappings \(T_n\). In the present paper, the authors generalize these results in a way which appears very interesting and useful.
Recommendations
- An iterative algorithm of solution for quadratic minimization problem in Hilbert spaces
- An iterative algorithm for approximating convex minimization problem
- Convergence of a general iterative method for nonexpansive mappings in Hilbert spaces
- Iterative computation for solving convex optimization problems over the set of common fixed points of quasi-nonexpansive and demicontractive mappings
- Iterative algorithms for minimum-norm fixed point of non-expansive mapping in Hilbert space
Cites work
- An iterative approach to quadratic optimization
- Approximation of fixed points of nonexpansive mappings
- Fixed points of nonexpanding maps
- FIXED-POINT THEOREMS FOR NONCOMPACT MAPPINGS IN HILBERT SPACE
- scientific article; zbMATH DE number 3933858 (Why is no real title available?)
- Iterative approaches to finding nearest common fixed points of nonexpansive mappings in Hilbert spaces.
- 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
- The approximation of fixed points of compositions of nonexpansive mappings in Hilbert space
Cited in
(17)- An iterative approach to quadratic optimization
- Iterative minimization of quadratic functionals
- Iterative algorithms of generalized nonexpansive mappings and monotone operators with application to convex minimization problem
- An iterative algorithm for approximating convex minimization problem
- Quadratic optimization of fixed points for a family of nonexpansive mappings in Hilbert space
- scientific article; zbMATH DE number 6378119 (Why is no real title available?)
- A general iterative scheme with applications to convex optimization and related fields
- Iterative algorithms with some control conditions for quadratic optimizations
- Minimizing certain convex functions over the intersection of the fixed point sets of nonexpansive mappings
- scientific article; zbMATH DE number 2168917 (Why is no real title available?)
- scientific article; zbMATH DE number 220318 (Why is no real title available?)
- A scheme of iterative minimization methods
- scientific article; zbMATH DE number 932403 (Why is no real title available?)
- Iterative computation for solving convex optimization problems over the set of common fixed points of quasi-nonexpansive and demicontractive mappings
- Some iterative methods for finding fixed points and for solving constrained convex minimization problems
- Convex minimization over the fixed point set of demicontractive mappings
- An iterative algorithm of solution for quadratic minimization problem in Hilbert spaces
This page was built for publication: Iterative Approaches to Convex Minimization Problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4678765)