Pith. sign in

REVIEW 1 cited by

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 1711.03208 v2 pith:DPXMC3WA submitted 2017-11-08 math.OC

A non-smooth trust-region method for locally Lipschitz functions with application to optimization problems constrained by variational inequalities

classification math.OC
keywords problemsconstrainedfunctionsmethodtrust-regionvariationalalgorithmapplication
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

We propose a nonsmooth trust-region method for solving optimization problems with locally Lipschitz continuous functions, with application to problems constrained by variational inequalities of the second kind. Under suitable assumptions on the model functions, convergence of the general algorithm to a C-stationary point is verified. For variational inequality constrained problems, we are able to properly characterize the Bouligand subdifferential of the reduced cost function and, based on that, we propose a computable trust-region model which fulfills the convergence hypotheses of the general algorithm. The article concludes with the experimental study of the main properties of the proposed method based on two different numerical instances.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

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

  1. Single-loop approaches to nonsmooth bilevel optimisation

    math.OC 2026-06 unverdicted novelty 6.0

    Develops optimistic and pessimistic calculus rules for set-valued bilevel constraints, derives nonsmooth adjoint inclusions, and proposes a convergent single-loop algorithm demonstrated on total variation inverse problems.