Some iterative methods for finding fixed points and for solving constrained convex minimization prob
By Lu-Chuan Ceng, Qamrul Hasan Ansari, Jianchun Yao. 2011
144 citations recorded by the source corpus.
Subfields: Computational Theory and Mathematics, Geometry and Topology, Numerical Analysis
View Paper: https://www.semanticscholar.org/paper/e36779bfcf9e012a31ed8cceafc29f3b094dca2c
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Computational Theory and Mathematics
In Geometry and Topology
In Numerical Analysis
Citations in the corpus
- A monotone Bregan projection algorithm for fixed point and equilibrium problems in a reflexive Banach space (2020, background): “Equilibrium problem 1 provides us a a general and unified framework to study a wide class of problems arising in convex optimization problems; see [6, 12, 15, 16, 22] and the references.”
- A general iterative method for approximation of fixed points and their applications (2013, unknown): “(see, [11, 12, 15, 16, 17, 18, 19, 21, 22, 24]).”