Circumscribed ellipsoid algorithm for fixed-point problems
نویسندگان
چکیده
منابع مشابه
Circumscribed ellipsoid algorithm for fixed-point problems
We present a new implementation of the almost optimal Circumscribed Ellipsoid (CE) Algorithm for approximating fixed points of nonexpanding functions, as well as of functions that may be globally expanding, however, are nonexpanding/contracting in the direction of fixed points. Our algorithm is based only on function values, i.e., it does not require computing derivatives of any order. We utili...
متن کاملAn Interior Ellipsoid Algorithm for Fixed Points
We consider the problem of approximating xed points of non smooth con tractive functions with using of the absolute error criterion In we proved that the upper bound on the number of function evaluations to compute approximations is O n ln ln q ln n in the worst case where q is the contraction factor and n is the dimension of the problem This upper bound is achieved by the circumscribed ellipso...
متن کاملA strong convergence theorem for solutions of zero point problems and fixed point problems
Zero point problems of the sum of two monotone mappings and fixed point problems of a strictly pseudocontractive mapping are investigated. A strong convergence theorem for the common solutions of the problems is established in the framework of Hilbert spaces.
متن کاملParallel synchronous algorithm for nonlinear fixed point problems
with respect to the Euclidian norm, where F :Rn →Rn is a nonlinear operator. Section 2 is devoted to a brief description of asynchronous parallel algorithm. In Section 3, we prove the main result concerning the convergence of the general algorithm in the synchronous case to a fixed point of a nonlinear operator fromRn to Rn. A particular case of this algorithm (algorithm of Jacobi) is applied i...
متن کاملImproved infeasible-interior-point algorithm for linear complementarity problems
We present a modified version of the infeasible-interior- We present a modified version of the infeasible-interior-point algorithm for monotone linear complementary problems introduced by Mansouri et al. (Nonlinear Anal. Real World Appl. 12(2011) 545--561). Each main step of the algorithm consists of a feasibility step and several centering steps. We use a different feasibility step, which tar...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematics of Computation
سال: 2010
ISSN: 0025-5718,1088-6842
DOI: 10.1090/s0025-5718-2010-02443-3