The Semismooth Approach for Semi-Infinite Programming without Strict Complementarity

DOI10.1137/080719765zbMath1259.90149OpenAlexW2013669246MaRDI QIDQ3563921

Aysun Tezel, Oliver Stein

Publication date: 1 June 2010

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

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

zbMATH Keywords

generalized semi-infinite optimizationsemismooth Newton methodreduction ansatznonlinear complementarity problem functionClarke subdifferential regularity

Mathematics Subject Classification ID

Optimality conditions and duality in mathematical programming (90C46) Numerical methods based on necessary conditions (49M05) Newton-type methods (49M15) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Semi-infinite programming (90C34)

Related Items

Smoothing SQP algorithm for semismooth equations with box constraints ⋮ A smoothing Levenberg-Marquardt method for generalized semi-infinite programming ⋮ How to solve a semi-infinite optimization problem ⋮ Gauss-Newton-type methods for bilevel optimization ⋮ Interior point filter method for semi-infinite programming problems