Pith. sign in

REVIEW 2 cited by

On the local convergence of the semismooth Newton method for 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

arxiv 2211.01127 v2 pith:4EY6C3HD submitted 2022-11-02 math.OC

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

In this paper, we consider a large class of nonlinear equations derived from first-order type methods for solving composite optimization problems. Traditional approaches to establishing superlinear convergence rates of semismooth Newton-type methods for solving nonlinear equations usually postulate either nonsingularity of the B-Jacobian or smoothness of the equation. We investigate the feasibility of both conditions. For the nonsingularity condition, we present equivalent characterizations in broad generality, and illustrate that they are easy-to-check criteria for some examples. For the smoothness condition, we show that it holds locally for a large class of residual mappings derived from composite optimization problems. Furthermore, we investigate a relaxed version of the smoothness condition - smoothness restricted to certain active manifolds. We present a conceptual algorithm utilizing such structures and prove that it has a superlinear convergence rate.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 2 Pith papers

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

  1. Stochastic Saddle Avoidance Beyond Unit Excitation and Smoothness: A Pathwise Lyapunov-Perron Framework

    math.OC 2026-08 accept novelty 8.0 of 10

    A new pathwise Lyapunov-Perron framework proves almost sure saddle avoidance for stochastic recursions without unit excitation, covering SGD, mirror descent, proximal stochastic gradient, and random reshuffling.

  2. A Globalized Semismooth Newton Method for Prox-regular Optimization Problems

    math.OC 2025-09 conditional novelty 7.0 of 10

    A hybrid proximal-gradient/semismooth-Newton method is proven to converge globally and superlinearly for composite optimization with prox-regular nonconvex nonsmooth terms.

Pith tools