In this work, we proposed an adaptive beamformer based on a novel heuristic optimization algorithm. The novel optimization technique inspired from Fibonacci sequence principle, designated as Fibonacci branch search (FBS), used new tree's branches fundamental structure and interactive searching rules to obtain the global optimal solution in the search space. The branch structure of FBS is selected using two types of multidimensional points on the basis of shortening fraction formed by Fibonacci sequence; in this mode, interactive global and local searching rules are implemented alternately to obtain the optimal solutions, avoiding stagnating in local optimum. The proposed FBS is also used here to construct an adaptive beamforming (ABF) technique as a real-time implementation to achieve near-optimal performance for its simplicity and high convergence rate, then, the performance of the FBS is compared with the five typical heuristic optimization algorithms. Simulation results demonstrate the superiority of the proposed FBS approach in locating the optimal solution with higher precision and reveal further improvement in the ABF performance.