Smoothing by mollifiers. Part II: nonlinear optimization

This article complements the paper [7], where we showed that a compact feasible set of a standard semi-infinite optimization problem can be approximated arbitrarily well by a level set of a single smooth function with certain regularity properties. In the special case of nonlinear programming this function is constructed as the mollification of the finite min-function which describes the feasible set. In the present article we treat the correspondences between KarushKuhn-Tucker points of the original and the smoothed problem, and between their associated Morse indices.

• Type: Journal
• Year: 2008
• Where: JGO
• Authors: Hubertus Th. Jongen, Oliver Stein
• Keywords: Compact Feasible Set, Feasible Set, JGO 2008, Single Smooth Function