REVIEW 1 cited by
Line Search and Trust-Region Methods for Convex-Composite Optimization
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
We consider descent methods for solving non-finite valued nonsmooth convex-composite optimization problems that employ Gauss-Newton subproblems to determine the iteration update. Specifically, we establish the global convergence properties for descent methods that use a backtracking line search, a weak Wolfe line search, or a trust-region update. All of these approaches are designed to exploit the structure associated with convex-composite problems.
Forward citations
Cited by 1 Pith paper
-
Projected proximal gradient trust-region algorithm for nonsmooth optimization
A trust-region method for nonsmooth composite optimization gets worst-case complexity bounds matching the smooth case under unbounded Hessian growth, and a new projected proximal-gradient subproblem solver is introduced.
Discussion (0). Continue with ORCID to comment.