A Bundle-Free Implicit Programming Approach for a Class of MPECs in Function Space
Please always quote using this URN:urn:nbn:de:0296-matheon-13267
- Using a standard first-order optimality condition for nonsmooth optimization problems, a general framework for a descent method is developed. This setting is applied to a class of mathematical programs with equilibrium constraints in function space from which a new algorithm is derived. Global convergence of the algorithm is demonstrated in function space and the results are then illustrated by numerical experiments.