نتایج جستجو برای: point algorithms
تعداد نتایج: 824064 فیلتر نتایج به سال:
In this paper we describe a systematic procedure to analyze the convergence of degenerate preconditioned proximal point algorithms. We establish weak results under mild assumptions that can be easily employed in context splitting methods for monotone inclusion and convex minimization problems. Moreover, show degeneracy preconditioner allows reduction variables involved iteration updates. streng...
in this paper we introduce new modified implicit and explicit algorithms and prove strong convergence of the two algorithms to a common fixed point of a family of uniformly asymptotically regularasymptotically nonexpansive mappings in a real reflexive banach space with a uniformly g$hat{a}$teaux differentiable norm. our result is applicable in $l_{p}(ell_{p})$ spaces,$1 < p
abstract: in this thesis, we focus to class of convex optimization problem whose objective function is given as a linear function and a convex function of a linear transformation of the decision variables and whose feasible region is a polytope. we show that there exists an optimal solution to this class of problems on a face of the constraint polytope of feasible region. based on this, we dev...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید