نتایج جستجو برای: large update methods
تعداد نتایج: 2775750 فیلتر نتایج به سال:
In this paper, we consider a primal-dual Newton method for linear complementarity problems (LCP) with P()-matrix. By using some new analysis tools, we prove polynomial complexity of the large update method without using a barrier or potential function. Our analysis is based on an appropriate proximity measure only. This proximity measure has not been used in the analysis of a large update metho...
Exploring Complexity of Large Update Interior-Point Methods for ) k ( P* Linear Complementarity Problems Based on Kernel Function KEYVAN AMINI* M.REZA PEYGHAMI +,2 ∗ Department of Sciences, Razi University, Kermanshah, Iran + Department of Sciences, Khajeh Nasir Toosi (KNT) University of Technology, Tehran, Iran Abstract. Interior Point Methods not only are the most effective methods in practic...
wireless sensor networks (wsns) are one of the most interesting consequences of innovations in different areas of technology including wireless and mobile communications, networking, and sensor design. these networks are considered as a class of wireless networks which are constructed by a set of sensors. a large number of applications have been proposed for wsns. besides having numerous applic...
In this paper we present two new numerical methods for unconstrained large-scale optimization. These methods apply update formulae, which are derived by considering different techniques of approximating the objective function. Theoretical analysis is given to show the advantages of using these update formulae. It is observed that these update formulae can be employed within the framework of lim...
due to extraordinary large amount of information and daily sharp increasing claimant for ui benefits and because of serious constraint of financial barriers, the importance of handling fraud detection in order to discover, control and predict fraudulent claims is inevitable. we use the most appropriate data mining methodology, methods, techniques and tools to extract knowledge or insights from ...
In this paper, we consider convex quadratic semidefinite optimization problems and provide a primal-dual Interior Point Method (IPM) based on a new kernel function with a trigonometric barrier term. Iteration complexity of the algorithm is analyzed using some easy to check and mild conditions. Although our proposed kernel function is neither a Self-Regular (SR) fun...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید