Pith. sign in

REVIEW

A New Class of Composite Objective Multi-step Estimating-sequence Techniques (COMET)

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 2111.06763 v1 pith:CBGX3J55 submitted 2021-11-12 math.OC

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

We devise a new accelerated gradient-based estimating sequence technique for solving large-scale optimization problems with composite structure. More specifically, we introduce a new class of estimating functions, which are obtained by utilizing a tight lower bound on the objective function. Then, by exploiting the coupling between the proposed estimating functions and the gradient mapping technique, we construct a class of composite objective multi-step estimating-sequence techniques (COMET). We propose an efficient line search strategy for COMET, and prove that it enjoys an accelerated convergence rate. The established convergence results allow for step size adaptation. Our theoretical findings are supported by extensive computational experiments on various problem types and datasets. Moreover, our numerical results show evidence of the robustness of the proposed method to the imperfect knowledge of the smoothness and strong convexity parameters of the objective function.

Discussion (0). Continue with ORCID to comment.

Pith tools