Pith. sign in

REVIEW 1 cited by

A mechanism of three-dimensional quadratic termination for the gradient method with applications

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2212.07255 v2 pith:B6FJEPEO submitted 2022-12-14 math.OC

classification math.OC
keywords quadraticgradientmethodterminationnovelpropertystepsizethree-dimensional
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Recent studies show that the two-dimensional quadratic termination property has great potential in improving performance of the gradient method. However, it is not clear whether higher-dimensional quadratic termination leads further benefits. In this paper, we provide an affirmative answer by introducing a mechanism of three-dimensional quadratic termination for the gradient method. A novel stepsize is derived from the mechanism such that a family of delayed gradient methods equipping with the novel stepsize have the three-dimensional quadratic termination property. When applied to the Barzilai--Borwein (BB) method, the novel stepsize does not require the use of any exact line search or the Hessian, and can be computed by stepsizes and gradient norms in previous iterations. Using long BB steps and some short steps associated with the novel stepsize in an adaptive manner, we develop an efficient gradient method for quadratic optimization and further extend it to general unconstrained optimization. Numerical experiments show that the three-dimensional quadratic termination property can significantly improve performance of the BB method, and the proposed method outperforms gradient methods that use stepsizes with the two-dimensional quadratic termination property.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. A Twin gradient method for unconstrained optimization

    math.NA 2026-07 conditional novelty 6.0 of 10

    A Twin-Step hybrid that couples two gradient paths by mutual-distance stepsizes, then switches to ABBmin when directions become collinear, improves gradient-evaluation counts over ABBmin alone.

Pith tools