The semismooth approach for semi-infinite programming without strict complementarity
From MaRDI portal
Clarke subdifferential regularitygeneralized semi-infinite optimizationnonlinear complementarity problem functionreduction ansatzsemismooth Newton method
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) Optimality conditions and duality in mathematical programming (90C46)
Recommendations
- The semismooth approach for semi-infinite programming under the reduction ansatz
- On the local convergence of semismooth Newton methods for linear and nonlinear second-order cone programs without strict complementarity
- Semismooth Newton methods for solving semi-infinite programming problems
- A smoothing Newton method for semi-infinite programming
- A new smoothing Newton-type algorithm for semi-infinite programming
Cited in
(8)- 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
- A nonsmooth Newton method with path search and its use in solving \(C^{1,1}\) programs and semi-infinite problems
- Interior point filter method for semi-infinite programming problems
- On Karush-Kuhn-Tucker points for a smoothing method in semi-infinite optimizations
- The semismooth approach for semi-infinite programming under the reduction ansatz
This page was built for publication: The semismooth approach for semi-infinite programming without strict complementarity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3563921)
