A Nonsmooth Newton Method with Path Search and Its Use in Solving $C^{1,1}$ Programs and Semi-Infinite Problems

DOI10.1137/090751025zbMath1216.65068OpenAlexW2074161970MaRDI QIDQ3083291

Stephan Bütikofer, Diethard Klatte

Publication date: 21 March 2011

Published in: SIAM Journal on Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/090751025

zbMATH Keywords

convergencenumerical examplesgeneralized semi-infinite programslocal Lipschitz functionnonsmooth Newton method\(C^{1,1}\) optimization

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Sensitivity, stability, parametric optimization (90C31) Methods of quasi-Newton type (90C53) Semi-infinite programming (90C34)

Related Items (3)

Unnamed Item ⋮ Approximations and generalized Newton methods ⋮ A globally convergent LP-Newton method for piecewise smooth constrained equations: escaping nonstationary accumulation points

This page was built for publication: A Nonsmooth Newton Method with Path Search and Its Use in Solving $C^{1,1}$ Programs and Semi-Infinite Problems