Projected Barzilai-Borwein methods for large-scale box-constrained quadratic programming

  • Authors:

  • Yu-Hong Dai;Roger Fletcher

  • Affiliations:

  • Academy of Mathematics and System Sciences, Chinese Academy of Sciences, State Key Laboratory of Scientific and Engineering Computing, Institute of Computational Mathematics and Scientific/Enginee ...;University of Dundee, Department of Mathematics, PO Box 2719, DD1 4HN, Dundee, Scotland, UK

  • Venue:
  • Numerische Mathematik
  • Year:
  • 2005

Quantified Score

Hi-index 0.01

Visualization

Abstract

This paper studies projected Barzilai-Borwein (PBB) methods for large-scale box-constrained quadratic programming. Recent work on this method has modified the PBB method by incorporating the Grippo-Lampariello-Lucidi (GLL) nonmonotone line search, so as to enable global convergence to be proved. We show by many numerical experiments that the performance of the PBB method deteriorates if the GLL line search is used. We have therefore considered the question of whether the unmodified method is globally convergent, which we show not to be the case, by exhibiting a counter example in which the method cycles. A new projected gradient method (PABB) is then considered that alternately uses the two Barzilai-Borwein steplengths. We also give an example in which this method may cycle, although its practical performance is seen to be superior to the PBB method. With the aim of both ensuring global convergence and preserving the good numerical performance of the unmodified methods, we examine other recent work on nonmonotone line searches, and propose a new adaptive variant with some attractive features. Further numerical experiments show that the PABB method with the adaptive line search is the best BB-like method in the positive definite case, and it compares reasonably well against the GPCG algorithm of Moré and Toraldo. In the indefinite case, the PBB method with the adaptive line search is shown on some examples to find local minima with better solution values, and hence may be preferred for this reason.