A nonsmooth Newton method with path search and its use in solving C^1,1 programs and semi-infinite problems

DOI10.1137/090751025MaRDI QIDQ3083291zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• Globalizing a nonsmooth Newton method via nonmonotone path search
• A nonsmooth version of Newton's method
• The semismooth approach for semi-infinite programming without strict complementarity
• Semismooth Newton methods for solving semi-infinite programming problems
• scientific article; zbMATH DE number 1054734

Cited in

(4)

• Globalizing a nonsmooth Newton method via nonmonotone path search
• On second-order Taylor expansion of critical values
• 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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3083291)