Duality for almost convex optimization problems via the perturbation approach

Authors:
Radu Ioan Boţ;Gábor Kassay;Gert Wanka
Affiliations:
Faculty of Mathematics, Chemnitz University of Technology, Chemnitz, Germany 09107;Faculty of Mathematics and Computer Science, Babeş-Bolyai University, Cluj-Napoca, Romania 400084;Faculty of Mathematics, Chemnitz University of Technology, Chemnitz, Germany 09107
Venue:
Journal of Global Optimization
Year:
2008

Citing 5
Cited 0

A generalization of Fenchel duality theory

Journal of Optimization Theory and Applications
On quasi-convex duality

Mathematics of Operations Research
On classes of generalized convex functions, Gordan-Farkas type theorems, and Lagrangian duality

Journal of Optimization Theory and Applications
On convex generalized systems

Journal of Optimization Theory and Applications
Convex analysis and variational problems

Convex analysis and variational problems

Quantified Score

Hi-index	0.00

Visualization

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.