On Fibonacci search method with k-Lucas numbers

@article{Yildiz2003OnFS,
  title={On Fibonacci search method with k-Lucas numbers},
  author={B{\"u}nyamin Yildiz and Erdal Karaduman},
  journal={Appl. Math. Comput.},
  year={2003},
  volume={143},
  pages={523-531}
}
Parametrized Fibonacci search method with k-Lucas numbers
Optimization by k-Lucas numbers
An Alternating Sum of Fibonacci and Lucas Numbers of Order k
During the last decade, many researchers have focused on proving identities that reveal the relation between Fibonacci and Lucas numbers. Very recently, one of these identities has been generalized
THE FIBONACCI QUARTERLY
. By interpreting various sums involving Fibonacci and Lucas numbers physically, we show how one can often generate an additional summation with little effort. To illustrate the fruitfulness of the
Study on Searching the Best Rise of Truss String Structure by Using Fibonacci Method
TLDR
Using Fibonacci to search the optimal rise in span of 100m of truss string structure and analysis the dynamic search interval show that the approximate solutions of this method is very approximate to exact solutions, and search efficiency is improved.
Implementation of a novel Fibonacci branch search optimizer for the design of the low sidelobe and deep nulling adaptive beamformer
TLDR
The performance of the FBS is compared with the five typical heuristic optimization algorithms and demonstrated the superiority of the proposed FBS approach in locating the optimal solution with higher precision and reveal further improvement in the ABF performance.
A BEAMFORMER DESIGN BASED ON FIBONACCI BRANCH SEARCH
TLDR
The reported simulation results demonstrate the superiority of the proposed FBS algorithm in locating the optimal solution with higher precision and reveal the further improvement in adaptive beamforming performance.
A Fibonacci Branch Search (FBS)-Based Optimization Algorithm for Enhanced Nulling Level Control Adaptive Beamforming Techinique
TLDR
An adaptive beamformer based on a Fibonacci branch search (FBS) based heuristic algorithm is proposed for uniform linear arrays and the performance of FBS is compared with that of five typical heuristic optimization algorithms.
...
...

References

SHOWING 1-4 OF 4 REFERENCES
A Nonsmooth Global Optimization Technique Using Slopes: The One-Dimensional Case
  • D. Ratz
  • Computer Science
    J. Glob. Optim.
  • 1999
In this paper we introduce a pruning technique based on slopes in the context of interval branch-and-bound methods for nonsmooth global optimization. We develop the theory for a slope pruning step
MAPLE: A Comprehensive Introduction
TLDR
This chapter introduces maple programming, a very simple way of thinking about algebra that can be applied to almost any kind of programming.
Practical optimization
TLDR
This ebook Practical Optimization by Philip E. Gill is presented in pdf format and the full version of this ebook in DjVu, ePub, doc, txt, PDF forms is presented.