CJG is a nonlinear conjugation gradient.
Algorithms have been used to solve large-scale
unconstrained enhancement problems. Because of their
minimal memory needs and global convergence qualities,
they are widely used in a variety of fields. This approach
has lately undergone many investigations and
modifications to enhance it. In our daily lives, the
conjugate gradient is incredibly significant. For example,
whatever we do, we strive for the best outcomes, such as
the highest profit, the lowest loss, the shortest road, or the
shortest time, which are referred to as the minimum and
maximum in mathematics, and one of these ways is the
process of spectral gradient descent. For multidimensional
unbounded objective function, the spectrum conjugated
gradient (SCJG) approach is a strong tool. In this study, we
describe a revolutionary SCG technique in which
performance is quantified. Based on assumptions, we
constructed the descent condition, sufficient descent
theorem, conjugacy condition, and global convergence
criteria using a robust Wolfe and Powell line search.
Numerical data and graphs were constructed utilizing
benchmark functions, which are often used in many
classical functions, to demonstrate the efficacy of the
recommended approach. According to numerical statistics,
the suggested strategy is more efficient than some current
techniques. In addition, we show how the unique method
may be utilized to improve solutions and outcomes.
See More
See Less