The Semismooth Approach for Semi-Infinite Programming without Strict Complementarity
From MaRDI portal
Publication:3563921
DOI10.1137/080719765zbMath1259.90149MaRDI QIDQ3563921
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
generalized semi-infinite optimization; semismooth Newton method; reduction ansatz; nonlinear complementarity problem function; Clarke subdifferential regularity
90C46: Optimality conditions and duality in mathematical programming
49M05: Numerical methods based on necessary conditions
49M15: Newton-type methods
90C33: Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming)
90C34: Semi-infinite programming
Related Items
Gauss-Newton-type methods for bilevel optimization, How to solve a semi-infinite optimization problem, Smoothing SQP algorithm for semismooth equations with box constraints, A smoothing Levenberg-Marquardt method for generalized semi-infinite programming, Interior point filter method for semi-infinite programming problems