Wissen, was gut ist. Studieren in Chemnitz.
Bot, Radu Ioan; Kassay, Gabor; Wanka, Gert : Duality for almost convex optimization problems via the perturbation approach

Bot, Radu Ioan ; Kassay, Gabor ; Wanka, Gert : Duality for almost convex optimization problems via the perturbation approach

Author(s):
Bot, Radu Ioan
Kassay, Gabor
Wanka, Gert
Title:
Duality for almost convex optimization problems via the perturbation approach
Preprint series:
Technische Universität Chemnitz, Fakultät für Mathematik (Germany). Preprint 6, 2007
Mathematics Subject Classification:
26A51 [ Convexity, generalizations ]
42A50 [ Conjugate functions, conjugate series, singular integrals ]
49N15 [ Duality theory ]
Abstract:
We deal with duality for almost convex finite dimensional optimization problems by means of the classical perturbation approach. To this aim some standard results from the convex analysis are extended to the case of almost convex sets and functions. The duality for some classes of primal-dual problems is derived as a special case of the general approach. The sufficient regularity conditions we need for guaranteeing strong duality are proved to be similar to the ones in the convex case.
Keywords:
almost convex sets, almost convex functions, conjugate functions, duality, perturbation approach
Language:
English
Publication time:
2 / 2007