Smoothing by mollifiers. Part II: nonlinear optimization

Authors:
Hubertus Th. Jongen;Oliver Stein
Affiliations:
Department of Mathematics --- C, RWTH Aachen University, Aachen, Germany 52056;School of Economics and Business Engineering, University of Karlsruhe, Karlsruhe, Germany 76128
Venue:
Journal of Global Optimization
Year:
2008

Citing 2
Cited 2

The Minimization of Semicontinuous Functions: Mollifier Subgradients

SIAM Journal on Control and Optimization
Smoothing by mollifiers. Part I: semi-infinite optimization

Journal of Global Optimization

Smoothing by mollifiers. Part I: semi-infinite optimization

Journal of Global Optimization
On Interior Logarithmic Smoothing and Strongly Stable Stationary Points

SIAM Journal on Optimization

Quantified Score

Hi-index	0.00

Visualization

Abstract

This article complements the paper (Jongen, Stein, Smoothing by mollifers part I: semi-infinite optimization J Glob Optim doi: 10.1007/s10898-007-9232-3 ), 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 Karush---Kuhn---Tucker points of the original and the smoothed problem, and between their associated Morse indices.