The analysis of p-term algorithms for unconstrained optimization
نویسندگان
چکیده
منابع مشابه
Minimax Optimal Algorithms for Unconstrained Linear Optimization
We design and analyze minimax-optimal algorithms for online linear optimization games where the player’s choice is unconstrained. The player strives to minimize regret, the difference between his loss and the loss of a post-hoc benchmark strategy. While the standard benchmark is the loss of the best strategy chosen from a bounded comparator set, we consider a very broad range of benchmark funct...
متن کاملThe Algorithms of Broyden-CG for Unconstrained Optimization Problems
The conjugate gradient method plays an important role in solving large-scaled problems and the quasi-Newton method is known as the most efficient method in solving unconstrained optimization problems. Therefore, in this paper, the new hybrid 2592 Mohd Asrul Hery Ibrahim et al. method between the conjugate gradient method and the quasi-newton method for solving optimization problem is suggested....
متن کاملa time-series analysis of the demand for life insurance in iran
با توجه به تجزیه و تحلیل داده ها ما دریافتیم که سطح درامد و تعداد نمایندگیها باتقاضای بیمه عمر رابطه مستقیم دارند و نرخ بهره و بار تکفل با تقاضای بیمه عمر رابطه عکس دارند
Comparative Study of Bio-inspired algorithms for Unconstrained Optimization Problems
Nature inspired meta-heuristic algorithms are iterative search processes which find near optimal solutions by efficiently performing exploration and exploitation of the solution space. Considering the solution space in a specified region, this work compares performances of Bat, Cuckoo search and Firefly algorithms for unconstrained optimization problems. Global optima are found using various te...
متن کاملPerformance Profiles of Line-search Algorithms for Unconstrained Optimization
k is a continuously differentiable function, bounded from below, two main approaches are operational to date. The first one is based on the line-search concept which assures the global convergence of the methods. The idea is to use a quadratic model in order to generate a search direction and then find a suitable stepsize along the direction. Although it is successful at most time it does not u...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Researches in Mathematics and Mechanics
سال: 2017
ISSN: 2519-206X
DOI: 10.18524/2519-206x.2017.1(29).135732