The analysis of p-term algorithms for unconstrained optimization

Abstract

Consider the multidimensional unconstrained minimization problem in a case of continuously differentiable function. An iterative algorithm for solving such a problem is called a multi-term if in order to find the next approximation to the optimal point we need to compute values of the function or its gradient in two or more previous points. So that, conjugate gradient algorithm is a two-term algorithm. The aim of this paper is to study a generalized 𝑝-term method for unconstrained optimization. One substantiates the properties of this algorithm for quadratic functions and proves that it relates to conjugate direction methods. The goal of computational experiment was to compare the results of minimization with different number of terms 𝑝 and find the “optimal” value for the 𝑝. The numerical results for some well-known test functions are given.

Authors and Affiliations

Ye. M. Strakhov, A. T. Yaroviy

Keywords

Related Articles

ON THE STRUCTURE OF THE FUNDAMENTAL MATRIX OF THE LINEAR HOMOGENEOUS DIFFERENRIAL SYSTEM OF THE SPECIAL KIND

For the linear homogeneous differenrial system, whose coefficients are represented as an absolutely and uniformly convergent Fourier-series with slowly varying coefficients and frequency, the kind of the fundamental matr...

The 𝜏 (𝛼) function on the integer gaussian with fixed amount of the prime divisors

The distribution of the divisor’s function’s values 𝜏 (𝛼) over 𝑍[𝑖] in the arithmetical progressions with the growing progression’s difference was analized in present work. The asymptotic formulae for the sum function, w...

On exponential sums involving the divisor function over Z[𝑖]

We apply the van der Corput transform to investigate the sums of view Σ︀ 𝑟(𝑛)𝑔(𝑛)𝑒(𝑓(𝑛))), where 𝑟(𝑛) is the number of representations of 𝑛 as the sum of two squares of integer numbers. Such sums have been studied by M....

Boundary-value problem for differential equation of fractional order

In this paper we received the sufficient conditions of existence and uniqueness of solution of boundary-value problem for fractional order differential equation.

About embedding anisotropic classes in metric spaces with integral metric

Let L0 (Tm) be a set of periodic measurable real-valued functions of m variables, ψ : R1+ → R1+ be the continuity modulus and Lψ(Tm) = {f ∈ L0(Tm) : _f_ψ := _ Tm ψ (|f(x)|) dx < ∞}. The sufficient conditions for embeddin...

Download PDF file
  • EP ID EP342739
  • DOI -
  • Views 68
  • Downloads 0

How To Cite

Ye. M. Strakhov, A. T. Yaroviy (2017). The analysis of p-term algorithms for unconstrained optimization. Дослідження в математиці і механіці, 22(1), 70-80. https://europub.co.uk/articles/-A-342739