نتایج جستجو برای: Polynomial complexity

تعداد نتایج: 388155  

Journal: :bulletin of the iranian mathematical society 2011
m. salahi

Journal: :bulletin of the iranian mathematical society 2012
maryam zangiabadi hossein mansouri

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 targ...

Journal: :Mathematical Proceedings of the Cambridge Philosophical Society 2013

Journal: :SIAM Journal on Computing 2015

Journal: :bulletin of the iranian mathematical society 2011
h. mansouri m. zangiabadi

Journal: :bulletin of the iranian mathematical society 0
n. mahdavi-amiri faculty of‎ ‎mathematical sciences‎, ‎sharif‎ ‎university of technology‎, ‎tehran‎, ‎iran. b. kheirfam azarbaijan shahid madani university, ‎tabriz‎, ‎iran.

we present an improved version of a full nesterov-todd step infeasible interior-point method for linear complementarityproblem over symmetric cone (bull. iranian math. soc.,40(3), 541-564, (2014)). in the earlier version, each iteration consistedof one so-called feasibility step and a few -at most three -centering steps. here, each iteration consists of only a feasibilitystep. thus, the new alg...

Journal: :Computers & Mathematics with Applications 1987

Journal: :International Journal of Algebra and Computation 2016

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید