REVIEW 2 cited by
Efficient Regularized Proximal Quasi-Newton Methods for Large-Scale Nonconvex Composite Optimization Problems
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
read the original abstract
Optimization problems with composite functions consist of an objective function which is the sum of a smooth and a (convex) nonsmooth term. This particular structure is exploited by the class of proximal gradient methods and some of their generalizations like proximal Newton and quasi-Newton methods. In this paper, we propose a regularized proximal quasi-Newton method whose main features are: (a) the method is globally convergent to stationary points, (b) the globalization is controlled by a regularization parameter, no line search is required, (c) the method can be implemented very efficiently based on a simple observation which combines recent ideas for the computation of quasi-Newton proximity operators and compact representations of limited-memory quasi-Newton updates. Numerical examples for the solution of convex and nonconvex composite optimization problems indicate that the method outperforms several existing methods.
Forward citations
Cited by 2 Pith papers
-
Convergence rates of regularized quasi-Newton methods without strong convexity
Under the Kurdyka-Lojasiewicz property, regularized SR1 quasi-Newton methods achieve non-asymptotic superlinear convergence without strong convexity.
-
On the Universality of Simple Trust-Region Algorithms
Classical and modified-ratio trust-region methods reach the optimal O(ε^{-1/(1+ν)}) convex and O(ε^{-(2+ν)/(1+ν)}) nonconvex complexity for any Hölder ν∈[0,1] without knowing ν.
Discussion (0). Continue with ORCID to comment.