نتایج جستجو برای: bound methods

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

Journal: :IMA Journal of Numerical Analysis 2006

Journal: :Linear Algebra and its Applications 1997

Journal: :Journal of Computational and Applied Mathematics 2003

Journal: :bulletin of the iranian mathematical society 2011
r. lashkaripour g. talebi

An infeasible interior-point algorithm for mixed symmetric cone linear complementarity problems is proposed. Using the machinery of Euclidean Jordan algebras and Nesterov-Todd search direction, the convergence analysis of the algorithm is shown and proved. Moreover, we obtain a polynomial time complexity bound which matches the currently best known iteration bound for infeasible interior-point ...

Journal: :Linear Algebra and its Applications 1996

In this paper, we present a full Newton step feasible interior-pointmethod for circular cone optimization by using Euclidean Jordanalgebra. The search direction is based on the Nesterov-Todd scalingscheme, and only full-Newton step is used at each iteration.Furthermore, we derive the iteration bound that coincides with thecurrently best known iteration bound for small-update methods.

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

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