An accelerated Sobolev gradient method for unconstrained optimization problems based on variable inner products

We propose an accelerated version of the classical gradient method for unconstrained optimization problems defined on a Sobolev space H with Hilbert structure. Motivated by empirical results available in the literature demonstrating improved convergence of Sobolev gradient methods with suitably chosen weights, we develop a rigorous and constructive approach allowing one to identify the optimal gradient g k = g ( λ k ) among gradients g ( λ ) parameterized by a weight function λ belonging to a finite-dimensional space of weights, which defines the inner product 〈 ⋅ , ⋅ 〉 λ in the space H . At the k th iteration of the method, where an approximation u k ∈ H to the minimizer is given, an optimal weight λ k is found as a solution of a nonlinear minimization problem in the space of weights R + N . The weight λ k defines the optimal gradient g k equal to the projection of the Newton step h k onto a certain finite-dimensional subspace T k , in the sense that P k ( σ g k − h k ) = 0 , where P k is the projection operator onto T k and σ a fixed step size. This property ensures that thus constructed gradient method attains a quadratic convergence in a certain sense for error components in T k , in addition to the linear convergence typical of the classical gradient method. A numerical implementation of the new approach is also proposed. Computational results based on two model problems confirm the theoretically established convergence properties, demonstrating that the proposed approach outperforms the standard steepest-descent method based on Sobolev gradients and compares favorably to the Newton–Krylov method.