pith. sign in

arxiv: 1711.03208 · v2 · pith:DPXMC3WAnew · 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
0
0 comments X
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.

This paper has not been read by Pith yet.

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.