نتایج جستجو برای: logarithmic quadratic proximal method

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

Journal: :Universität Trier, Mathematik/Informatik, Forschungsbericht 2006
Daniel Görgen Matthias Transier Peter Sturm Wolfgang Effelsberg

Nr. 08 06 H. Fernau Parameterized Algorithms for d-HITTING Set: the Weightes Case http://www.mathematik.uni-trier.de/tf/08_06.pdf Nr. 08 05 H. Fernau, D. Raible Exact Algorithms for Maximum Acyclic Subgraph on a Superclass of Cubic Graphs http://www.mathematik.uni-trier.de/tf/08_05.pdf Nr. 08 04 R. Tichatschke Auf den Schultern von Giganten: Zur Geschichte der Mathematischen Optimierung http://...

2015
Hynek Bednář Aleš Raidl Jiří Mikšovský

Initial errors in weather prediction grow in time and, as they become larger, their growth slows down and then stops at an asymptotic value. Time of reaching this saturation point represents the limit of predictability. This paper studies the asymptotic values and time limits in a chaotic atmospheric model for five initial errors, using ensemble prediction method (model's data) as well as error...

Journal: :فصلنامه تحقیقات کاربردی در علوم دامی 0
حسین غلامی استادیار، موسسه تحقیقات علوم دامی کشور محمد بابایی مربی پژوهشی، موسسه تحقیقات علوم دامی کشور ناصر تیمور نژاد کارشناس ارشد پژوهش مو سسه تحقیقات علوم دامی کشور

the aim of this study was to produce some of data needed for completing the iranian feed composition tables. the analyzed data in this research was from eilam range plants. the information about the range plants was collected from laboratory of animal science research institute of iran and some data was obtained from the final reports of research projects. the metabolized energy of range plants...

2011
Sharareh Alipour Alireza Zarei

For a set of n disjoint line segments S in R, the visibility testing problem (VTP) is to test whether the query point p sees a query segment s ∈ S. For this configuration, the visibility counting problem (VCP) is to preprocess S such that the number of visible segments in S from any query point p can be computed quickly. In this paper, we solve VTP in expected logarithmic query time using quadr...

2002
R. Delbourgo

Once massless quadratically divergent tadpole diagrams are discarded, because they contain no intrinsic scale, it is possible to convert other divergences into logarithmic form, using partial fraction identities; this includes the case of quadratic divergences, as has been applied to the linear sigma model. However the procedure must be carried out with due care, paying great attention to corre...

Journal: :Computers & Geosciences 2008
Mahendra P. Verma

SUMMARY – An ActiveX component to calculate temperature and vapour fraction in a geothermal reservoir using the quartz solubility geothermometry was written in Visual Basic. The approach is based on the conservation of mass and energy (enthalpy). Four representative types of regression equations for quartz solubility: (i) a quadratic regression equation of 1/T and pressure P, (ii) a linear equa...

Journal: :J. Optimization Theory and Applications 2012
Regina Sandra Burachik C. Yalçin Kaya Shoham Sabach

We devise a new generalized univariate Newton method for solving nonlinear equations, motivated by Bregman distances and proximal regularization of optimization problems. We prove quadratic convergence of the new method, a special instance of which is the classical Newton’s method. We illustrate the possible benefits of the new method over classical Newton’s method by means of test problems inv...

2012
Yufei Tao

The topic of this lecture is about indexing. Namely, given an input set S of elements, we would like to preprocess S by creating a data structure on it. Then, given any query, we can utilize the structure to answer it efficiently, in particular, with much lower cost than if we did not have the structure. As an example, let us recall when the binary search tree – a fundamental structure at the u...

Journal: :Adv. Operations Research 2012
Xiaoling Fu Xiangfeng Wang Haiyan Wang Ying Zhai

The problems studied are the separable variational inequalities with linearly coupling constraints. Some existing decomposition methods are very problem specific, and the computation load is quite costly. Combining the ideas of proximal point algorithm PPA and augmented Lagrangian method ALM , we propose an asymmetric proximal decomposition method AsPDM to solve a wide variety separable problem...

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

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